中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A computational framework for Karl Popper's logic of scientific discovery

文献类型:期刊论文

作者Li Wei1; Sui Yuefei2
刊名中国科学:信息科学(英文版)
出版日期2018
卷号61.0期号:004页码:042101
关键词科学发现 计算框架 逻辑 卡尔 近似推理 可满足性 近似算法 修订
ISSN号1674-733X
英文摘要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.
语种英语
源URL[http://119.78.100.204/handle/2XEOYT63/30900]  
专题中国科学院计算技术研究所期刊论文_中文
作者单位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.

入库方式: OAI收割

来源:计算技术研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。