AGM-Style Belief Revision of Logic Programs under Answer Set Semantics

We address the problem of belief revision in (nonmonotonic) logic programming under answer set semantics: given logic programs P and Q, the goal is to determine a program R that corresponds to the revision of P by Q, denoted P * Q. Unlike previous approaches in logic programming, our formal techniques are analogous to those of distance-based belief revision in propositional logic. In developing our results, we build upon the model theory of logic programs furnished by SE models. Since SE models provide a formal, monotonic characterisation of logic programs, we can adapt well-known techniques from the area of belief revision to revision in logic programs. We investigate two specific operators: (logic program) expansion and a revision operator based on the distance between the SE models of logic programs. It proves to be the case that expansion is an interesting operator in its own right, unlike in classical AGM-style belief revision where it is relatively uninteresting. Expansion and revision are shown to satisfy a suite of interesting properties; in particular, our revision operators satisfy the majority of the AGM postulates for revision. A complexity analysis reveals that our revision operators do not increase the complexity of the base formalism. As a consequence, we present an encoding for computing the revision of a logic program by another, within the same logic programming framework.

[1]  Ken Satoh.  Nonmonotonic Reasoning by Minimal Belief Revision , 1988, FGCS.

[2]  James P. Delgrande.  A program-level approach to revising logic programs under the answer set semantics , 2010, Theory Pract. Log. Program..

[3]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.

[4]  Stefan Woltran,et al.  Belief revision within fragments of propositional logic , 2012, J. Comput. Syst. Sci..

[5]  David Pearce,et al.  Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..

[6]  David Nelson,et al.  Constructible falsity , 1949, Journal of Symbolic Logic.

[7]  Cees Witteveen,et al.  Revision of Non-Monotonic Theories , 1994, JELIA.

[8]  Chiaki Sakama,et al.  Negation as Failure in the Head , 1998, J. Log. Program..

[9]  Vladimir Lifschitz,et al.  Answer Sets in General Nonmonotonic Reasoning (Preliminary Report) , 1992, KR.

[10]  Hirofumi Katsuno,et al.  On the Difference between Updating a Knowledge Base and Revising It , 1991, KR.

[11]  Gabriele Kern-Isberner,et al.  Belief Base Change Operations for Answer Set Programming , 2012, JELIA.

[12]  James P. Delgrande,et al.  Revising Horn Theories , 2011, IJCAI.

[13]  Peter Gärdenfors,et al.  Belief Revision , 1995 .

[14]  Chiaki Sakama,et al.  An abductive framework for computing knowledge base updates , 2003, Theory Pract. Log. Program..

[15]  Stefan Woltran,et al.  Simplifying Logic Programs Under Uniform and Strong Equivalence , 2004, LPNMR.

[16]  Norman Y. Foo,et al.  Towards Generalized Rule-based Updates , 1997, IJCAI.

[17]  Teodor C. Przymusinski,et al.  Update by Means of Inference Rules , 1997, J. Log. Program..

[18]  Mauricio Osorio,et al.  Updates in answer set programming: An approach based on basic structural properties , 2006, Theory and Practice of Logic Programming.

[19]  Mauricio Osorio,et al.  Updates in Answer Set Programming based on structural properties , 2005 .

[20]  Judea Pearl,et al.  On the Logic of Iterated Belief Revision , 1994, Artif. Intell..

[21]  Wolfgang Faber,et al.  Logic Programming and Nonmonotonic Reasoning , 2011, Lecture Notes in Computer Science.

[22]  Hirofumi Katsuno,et al.  Propositional Knowledge Base Revision and Minimal Change , 1991, Artif. Intell..

[23]  Pedro Cabalar,et al.  Propositional theories are strongly equivalent to logic programs , 2007, Theory Pract. Log. Program..

[24]  SakamaChiaki,et al.  An abductive framework for computing knowledge base updates , 2003 .

[25]  TurnerHudson.  Strong equivalence made easy: nested expressions and weight constraints , 2003 .

[26]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[27]  Chiaki Sakama,et al.  Updating Extended Logic Programs through Abduction , 1999, LPNMR.

[28]  Stefan Woltran,et al.  Model-based recasting in answer-set programming , 2013, J. Appl. Non Class. Logics.

[29]  José Júlio Alferes,et al.  Dynamic Logic Programming , 1998, APPIA-GULP-PRODE.

[30]  P G rdenfors,et al.  Knowledge in flux: modeling the dynamics of epistemic states , 1988 .

[31]  Stefan Woltran,et al.  On Solution Correspondences in Answer-Set Programming , 2005, IJCAI.

[32]  José Júlio Alferes,et al.  Dynamic updates of non-monotonic knowledge bases , 2000, J. Log. Program..

[33]  Eduardo L. Fermé,et al.  Belief Revision , 2007, Inteligencia Artif..

[34]  Hans Tompits,et al.  A Preference-Based Framework for Updating Logic Programs , 2007, LPNMR.

[35]  João Leite,et al.  Robust Equivalence Models for Semantic Updates of Answer-Set Programs , 2012, KR.

[36]  Hans Tompits,et al.  On properties of update sequences based on causal rejection , 2001, Theory and Practice of Logic Programming.

[37]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

[38]  Enrico Motta,et al.  The Semantic Web - ISWC 2005, 4th International Semantic Web Conference, ISWC 2005, Galway, Ireland, November 6-10, 2005, Proceedings , 2005, SEMWEB.

[39]  Georg Gottlob,et al.  On the complexity of propositional knowledge base revision, updates, and counterfactuals , 1992, Artif. Intell..

[40]  Pavlos Peppas,et al.  Handbook of Knowledge Representation Edited Belief Revision Pavlos Peppas 8.1 Introduction , 2022 .

[41]  Victor W. Marek,et al.  Revision Programming , 1998, Theor. Comput. Sci..

[42]  Stefan Woltran,et al.  A Model-Theoretic Approach to Belief Change in Answer Set Programming , 2013, TOCL.

[43]  João Leite,et al.  Evolving knowledge bases : specification and semantics , 2003 .

[44]  Hudson Turner,et al.  Strong equivalence made easy: nested expressions and weight constraints , 2003, Theory and Practice of Logic Programming.

[45]  Grigoris Antoniou,et al.  On Applying the AGM Theory to DLs and OWL , 2005, SEMWEB.

[46]  Frank van Harmelen,et al.  Handbook of Knowledge Representation , 2008, Handbook of Knowledge Representation.

[47]  Alex M. Andrew,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2004 .

[48]  Craig Boutilier,et al.  Iterated revision and minimal change of conditional beliefs , 1996, J. Philos. Log..

[49]  Tetsuya Murai,et al.  A Method of Belief Base Revision for Extended Logic Programs Based on State Transition Diagrams , 2004, KES.

[50]  Mukesh Dalal,et al.  Investigations into a Theory of Knowledge Base Revision , 1988, AAAI.

[51]  Norman Y. Foo,et al.  Updating Logic Programs , 1998, ECAI.

[52]  Craig Boutilier,et al.  Revision Sequences and Nested Conditionals , 1993, IJCAI.