Default reasoning and belief revision: A syntax-independent approach |
| |
Authors: | Dongmo Zhang Zhaohui Zhu Shifu Chen |
| |
Affiliation: | (1) Department of Computer Science and Engineering, Nanjing University of Aeronautics and Astronautics, 210016 Nanjing, P.R. China;(2) State Key Lab for Novel Software Technology, Nanjing University, 210093 Nanjing, P.R. China |
| |
Abstract: | As an important variant of Relier's default logic, Poole (1988) developed a nonmonotonic reasoning framework in the classical first-order language. Brewka and Nebel extended Poole's approach in order to enable a representation of priorities between defaults. In this paper a general framework for default reasoning is presented, which can be viewed as a generalization of the three approaches above. It is proved that the syntax-independent default reasoning in this framework is identical to the general belief revision operation introduced by Zhang et al. (1997). This result provides a solution to the problem whether there is a correspondence between belief revision and default logic for the infinite case. As a by-product, an answer to the question, raised by Mankinson and Gardenfors (1991), is also given about whether there is a counterpart contraction in nonmonotonic logic. |
| |
Keywords: | nonmonotonic logic default reasoning belief revision |
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录! |
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载免费的PDF全文 |