Belief revision within fragments of propositional logic

被引:19
作者
Creignou, Nadia [1 ]
Papini, Odile [2 ]
Pichler, Reinhard [3 ]
Woltran, Stefan [3 ]
机构
[1] Aix Marseille Univ, CNRS, LIF UMR 7279, F-13288 Marseille, France
[2] Aix Marseille Univ, CNRS, LSIS UMR 7296, F-13288 Marseille, France
[3] Vienna Univ Technol, Inst Informat Syst, A-1040 Vienna, Austria
基金
奥地利科学基金会;
关键词
Belief revision; Complexity; Fragments of propositional logic; KM postulates; KNOWLEDGE-BASE REVISION; COMPLEXITY; FRAMEWORK; UPDATE; SETS;
D O I
10.1016/j.jcss.2013.08.002
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Belief revision has been extensively studied in the framework of propositional logic, but just recently revision within fragments of propositional logic has gained attention. Hereby it is not only the belief set and the revision formula which are given within a certain language fragment, but also the result of the revision has to be located in the same fragment. So far, research in this direction has been mainly devoted to the Horn fragment of classical logic. Here we present a general approach to define new revision operators derived from known operators, such that the result of the revision remains in the fragment under consideration. Our approach is not limited to the Horn case but applicable to any fragment of propositional logic where the models of the formulas are closed under a Boolean function. Thus we are able to uniformly treat cases as dual Horn, Krom and affine formulas, as well. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:427 / 449
页数:23
相关论文
共 52 条
[21]   A preference-based framework for updating logic programs [J].
Delgrande, James P. ;
Schaub, Torsten ;
Tompits, Hans .
LOGIC PROGRAMMING AND NONMONOTONIC REASONING, PROCEEDINGS, 2007, 4483 :71-+
[22]  
Delgrande JamesP., 2008, Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, KR 2008, Sydney, Australia, September 16-19, 2008, P411
[23]  
Dubois D., 2011, P ECSQARU, P1
[24]   ON THE COMPLEXITY OF PROPOSITIONAL KNOWLEDGE BASE REVISION, UPDATES, AND COUNTERFACTUALS [J].
EITER, T ;
GOTTLOB, G .
ARTIFICIAL INTELLIGENCE, 1992, 57 (2-3) :227-270
[25]   On properties of update sequences based on causal rejection [J].
Eiter, T ;
Fink, M ;
Sabbatini, G ;
Tompits, H .
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2002, 2 (06) :711-767
[26]   The complexity of nested counterfactuals and iterated knowledge base revisions [J].
Eiter, T ;
Gottlob, G .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1996, 53 (03) :497-512
[27]  
Flouris G, 2005, LECT NOTES COMPUT SC, V3729, P216, DOI 10.1007/11574620_18
[28]  
GOGIC G, 1994, PROCEEDINGS OF THE TWELFTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, P922
[29]   Constraints, consistency and closure [J].
Jeavons, P ;
Cohen, D ;
Cooper, MC .
ARTIFICIAL INTELLIGENCE, 1998, 101 (1-2) :251-265
[30]   PNP[O(LOG N)] AND SPARSE TURING-COMPLETE SETS FOR NP [J].
KADIN, J .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1989, 39 (03) :282-298