A computational framework for Karl Popper＇s logic of scientific discovery

	A computational framework for Karl Popper＇s logic of scientific discovery
	Li Wei 1; Sui Yuefei 2
	2018
发表期刊	中国科学：信息科学（英文版）
ISSN	1674-733X
卷号	61.0 期号:004 页码:042101
摘要	Belief revision is both a philosophical and logical problem. From Popper＇s logic of scientific discovery, we know that revision is ubiquitous in physics and other sciences. The AGM postulates and Rcalculus are approaches from logic, where the R-calculus is a Gentzen-type concrete belief revision operator.Because deduction is undecidable in first-order logic, we apply approximate deduction to derive an R-calculus that is computational and has finite injury. We further develop approximation algorithms for SAT problems to derive a feasible R-calculus based on the relation between deduction and satisfiability. In this manner, we provide a full spectrum of belief revision： from philosophical to feasible revision.
关键词	科学发现计算框架逻辑卡尔近似推理可满足性近似算法修订
语种	英语
文献类型	期刊论文
条目标识符	http://119.78.100.204/handle/2XEOYT63/30902
专题	中国科学院计算技术研究所期刊论文_中文
作者单位	1.北京航空航天大学 2.中国科学院计算技术研究所
推荐引用方式 GB/T 7714	Li Wei,Sui Yuefei. A computational framework for Karl Popper＇s logic of scientific discovery[J]. 中国科学：信息科学（英文版）,2018,61.0(004):042101.
APA	Li Wei,&Sui Yuefei.(2018).A computational framework for Karl Popper＇s logic of scientific discovery.中国科学：信息科学（英文版）,61.0(004),042101.
MLA	Li Wei,et al."A computational framework for Karl Popper＇s logic of scientific discovery".中国科学：信息科学（英文版） 61.0.004(2018):042101.