1. State Key Laboratory of Software Development Environment,Beihang University, Beijing 100191, China
2. Key Laboratory of Intelligent Information Processing, Institute of Computing Technology,Chinese Academy of Sciences, Beijing 100190, China
Corresponding author (email@example.com)
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 $R$-calculus 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.
Copyright 2019 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有