Belief revision in Horn theories

被引:36
作者
Delgrande, James P. [1 ]
Peppas, Pavlos [2 ,3 ]
机构
[1] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC V5A 1S6, Canada
[2] Univ Technol Sydney, FEIT, Ctr Quantum Computat & Intelligent Syst, Sydney, NSW 2007, Australia
[3] Univ Patras, Dept Business Adm, Patras 26500, Greece
基金
加拿大自然科学与工程研究理事会;
关键词
Knowledge representation; Belief revision; Horn logic; KNOWLEDGE-BASE REVISION; CONTRACTION; LOGIC;
D O I
10.1016/j.artint.2014.08.006
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper investigates belief revision where the underlying logic is that governing Horn clauses. We show that classical (AGM) belief revision doesn't immediately generalise to the Horn case. In particular, a standard construction based on a total preorder over possible worlds may violate the accepted (AGM) postulates. Conversely, in the obvious extension to the AGM approach, Horn revision functions are not captured by total preorders over possible worlds. We address these difficulties by introducing two modifications to the AGM approach. First, the semantic construction is restricted to "well behaved" orderings, what we call Horn compliant orderings. Second, the revision postulates are augmented by an additional postulate. Both restrictions are redundant in the AGM approach, but not in the Horn case. In a representation result we show that the class of revision functions captured by Horn compliant total preorders over possible worlds is precisely that given by the (extended) set of Horn revision postulates. Further, we show that Horn revision is compatible with work in iterated revision and work concerning relevance in revision. We also consider specific revision operators. Arguably this work is interesting for several reasons. It extends AGM revision to inferentially-weaker Horn theories; hence it sheds light on the theoretical underpinnings of belief change, as well as generalising the AGM paradigm. Thus, this work is relevant to revision in areas that employ Horn clauses, such as deductive databases and logic programming, as well as areas in which inference is weaker than classical logic, such as in description logic. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 22
页数:22
相关论文
共 32 条
[1]   ON THE LOGIC OF THEORY CHANGE - PARTIAL MEET CONTRACTION AND REVISION FUNCTIONS [J].
ALCHOURRON, CE ;
GARDENFORS, P ;
MAKINSON, D .
JOURNAL OF SYMBOLIC LOGIC, 1985, 50 (02) :510-530
[2]  
[Anonymous], 2004, NMR
[3]  
[Anonymous], P 13 INT C PRINC KNO
[4]  
[Anonymous], ACM T COMPUTATIONAL
[5]  
[Anonymous], 1988, P AAAI 88
[6]  
[Anonymous], P 13 INT C PRINC KNO
[7]  
[Anonymous], P 12 INT C PRINC KNO
[8]  
[Anonymous], 2011, P 22 INT JOINT C ART
[9]  
Booth R, 2011, J ARTIF INTELL RES, V42, P31
[10]  
Booth R, 2009, 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, P702