Belief revision within fragments of propositional logic

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. In this work, we present a general approach to define new revision operators derived from known operators (as for instance, Satoh's and Dalal's revision 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.

[1]  Bart Selman,et al.  Knowledge compilation and theory approximation , 1996, JACM.

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

[3]  Bernhard Nebel,et al.  How Hard is it to Revise a Belief Base , 1996 .

[4]  Maurice Pagnucco,et al.  Model Based Horn Contraction , 2012, KR.

[5]  Alfred Horn,et al.  On sentences which are true of direct unions of algebras , 1951, Journal of Symbolic Logic.

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

[7]  Christos H. Papadimitriou,et al.  Incremental Recompilation of Knowledge , 1994, AAAI.

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

[9]  James P. Delgrande,et al.  Horn Clause Contraction Functions: Belief Set and Belief Base Approaches , 2010, KR.

[10]  Richard Booth,et al.  Next Steps in Propositional Horn Contraction , 2009, IJCAI.

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

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

[13]  Martin C. Cooper,et al.  Constraints, Consistency and Closure , 1998, Artif. Intell..

[14]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[15]  Didier Dubois,et al.  Information Fusion and Revision in Qualitative and Quantitative Settings - Steps Towards a Unified Framework , 2011, ECSQARU.

[16]  Jan Chomicki,et al.  Answer sets for consistent query answering in inconsistent databases , 2002, Theory and Practice of Logic Programming.

[17]  Jan Chomicki,et al.  Consistent Query Answering: Five Easy Pieces , 2007, ICDT.

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

[19]  Paolo Liberatore.  Compilability and compact representations of revision of Horn knowledge bases , 2000, TOCL.

[20]  Jan Chomicki,et al.  Consistent query answers in the presence of universal constraints , 2008, Inf. Syst..

[21]  Balázs Szörényi,et al.  Horn Complements: Towards Horn-to-Horn Belief Revision , 2008, AAAI.

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

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

[24]  Alvaro del Val.  First order LUB approximations: characterization and algorithms , 2005, Artif. Intell..

[25]  Frederik Van De Putte.  Prime implicates and relevant belief revision , 2013, J. Log. Comput..

[26]  Leopoldo E. Bertossi,et al.  Database Repairing and Consistent Query Answering , 2011, Database Repairing and Consistent Query Answering.

[27]  Stefan Woltran,et al.  AGM-Style Belief Revision of Logic Programs under Answer Set Semantics , 2008, LPNMR.

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

[29]  Dongmo Zhang,et al.  Language Splitting and Relevance-Based Belief Change in Horn Logic , 2011, AAAI.

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

[31]  Marco Schaerf,et al.  Belief Revision and Update: Complexity of Model Checking , 2001, J. Comput. Syst. Sci..

[32]  Georg Gottlob,et al.  The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions , 1993, IJCAI.

[33]  James P. Delgrande,et al.  Horn Clause Belief Change: Contraction Functions , 2008, KR.

[34]  Bruno Zanuttini.  Approximating Propositional Knowledge with Affine Formulas , 2002, ECAI.

[35]  Bruno Zanuttini,et al.  A unified framework for structure identification , 2002, Inf. Process. Lett..

[36]  Alvaro del Val.  Approximate Knowledge Compilation: The First Order Case , 1996, AAAI/IAAI, Vol. 1.

[37]  Grigoris Antoniou,et al.  Generalizing the AGM postulates: preliminary results and applications , 2004, NMR.

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

[39]  Francesco Scarcello,et al.  Semantical and Computational Aspects of Horn Approximations , 1993, IJCAI.

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

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

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

[43]  Yacine Boufkhad.  Algorithms for Propositional KB Approximation , 1998, AAAI/IAAI.

[44]  Jim Kadin.  Deterministic Polynomial Time O(log n) Queries , 1986 .

[45]  Maurice Pagnucco,et al.  Transitively Relational Partial Meet Horn Contraction , 2011, IJCAI.

[46]  Jim Kadin,et al.  P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP , 1989, J. Comput. Syst. Sci..

[47]  Jan Chomicki,et al.  Query Answering in Inconsistent Databases , 2003, Logics for Emerging Applications of Databases.

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

[49]  Peter Schachte,et al.  Boolean Approximation Revisited , 2007, SARA.

[50]  Bernhard Nebel,et al.  Base Revision Operations and Schemes: Semantics, Representation and Complexity , 1994, ECAI.

[51]  György Turán,et al.  Horn Upper Bounds and Renaming , 2007, SAT.

[52]  R. Parikh.  Beliefs, belief revision, and splitting languages , 1999 .

[53]  Christos H. Papadimitriou,et al.  Incremental recompilation of knowledge (extended abstract) , 1994, AAAI 1994.