Propositional Update Operators Based on Formula/Literal Dependence

We present and study a general family of belief update operators in a propositional setting. Its operators are based on formula/literal dependence, which is more fine-grained than the notion of formula/variable dependence that was proposed in the literature: formula/variable dependence is a particular case of formula/literal dependence. Our update operators are defined according to the “forget-then-conjoin” scheme: updating a belief base by an input formula consists in first forgetting in the base every literal on which the input formula has a negative influence, and then conjoining the resulting base with the input formula. The operators of our family differ by the underlying notion of formula/literal dependence, which may be defined syntactically or semantically, and which may or may not exploit further information like known persistent literals and pre-set dependencies. We argue that this allows to handle the frame problem and the ramification problem in a more appropriate way. We evaluate the update operators of our family w.r.t. two important dimensions: the logical dimension, by checking the status of the Katsuno-Mendelzon postulates for update, and the computational dimension, by identifying the complexity of a number of decision problems (including model checking, consistency and inference), both in the general case and in some restricted cases, as well as by studying compactability issues. It follows that several operators of our family are interesting alternatives to previous belief update operators.

[1]  Craig Boutilier,et al.  A Unified Model of Qualitative Belief Change: A Dynamical Systems Perspective , 1998, Artif. Intell..

[2]  Hector J. Levesque,et al.  Iterated belief change in the situation calculus , 2000, Artif. Intell..

[3]  Maurizio Lenzerini,et al.  On the Update of Description Logic Ontologies at the Instance Level , 2006, AAAI.

[4]  Kenneth D. Forbus.  Introducing Actions into Qualitative Simulation , 1989, IJCAI.

[5]  Andreas Herzig,et al.  The PMA Revisited , 1996, KR.

[6]  Marco Schaerf,et al.  The Compactness of Belief Revision and Update Operators , 2004, Fundam. Informaticae.

[7]  Chitta Baral,et al.  Logic Programming and Reasoning about Actions , 2005, Handbook of Temporal Reasoning in Artificial Intelligence.

[8]  Matthew Suderman,et al.  Compositional Belief Update , 2007, FLAIRS Conference.

[9]  Fangzhen Lin,et al.  Causal Theories of Action: A Computational Core , 2003, IJCAI.

[10]  Fangzhen Lin,et al.  Forgetting and Knowledge Update , 2006, Australian Conference on Artificial Intelligence.

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

[12]  Andreas Herzig,et al.  Updates, actions, and planning , 2001, IJCAI.

[13]  Pierre Marquis,et al.  A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..

[14]  Pierre Marquis,et al.  Updating Epistemic States , 2001, Australian Joint Conference on Artificial Intelligence.

[15]  Konstantinos Georgatos,et al.  Belief Update Using Graphs , 2008, FLAIRS.

[16]  Enrico Giunchiglia,et al.  An Action Language Based on Causal Explanation: Preliminary Report , 1998, AAAI/IAAI.

[17]  Maurice Pagnucco,et al.  Gricean Belief Change , 2005, Stud Logica.

[18]  Aaron Hunter,et al.  Iterated Belief Change Due to Actions and Observations , 2011, J. Artif. Intell. Res..

[19]  Yan Zhang,et al.  Knowledge updates: Semantics and complexity issues , 2005, Artif. Intell..

[20]  Witold Lukaszewicz,et al.  First-order Generalization of the MPMA Belief Update Operator , 2009, Fundam. Informaticae.

[21]  Joachim Hertzberg,et al.  How to do Things with Worlds: On Formalizing Actions and Plans , 1993, J. Log. Comput..

[22]  Hudson Turner,et al.  Causal Theories of Action and Change , 1997, AAAI/IAAI.

[23]  Francesco M. Donini,et al.  The size of a revised knowledge base , 1995, PODS '95.

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

[25]  Chitta Baral,et al.  Representing Actions: Laws, Observations and Hypotheses , 1997, J. Log. Program..

[26]  Norman Y. Foo,et al.  A Syntax-based Approach to Reasoning about Action and Belief Update , 2006, J. Log. Comput..

[27]  Enrico Giunchiglia,et al.  Nonmonotonic causal theories , 2004, Artif. Intell..

[28]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[29]  Isto Aho,et al.  Interactive Knapsacks , 2000, Fundam. Informaticae.

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

[31]  Adnan Darwiche,et al.  Decomposable negation normal form , 2001, JACM.

[32]  Maurizio Lenzerini,et al.  On the Approximation of Instance Level Update and Erasure in Description Logics , 2007, AAAI.

[33]  Gabriel M. Kuper,et al.  Updating Logical Databases , 1986, Adv. Comput. Res..

[34]  M. de Rijke,et al.  Logic, Language and Computation , 1997 .

[35]  Guilin Qi,et al.  Prime Implicate-based Belief Revision Operators , 2008, ECAI.

[36]  Paolo Liberatore.  A Framework for Belief Update , 2000, JELIA.

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

[38]  Patrick Doherty,et al.  The PMA and relativizing change for action update , 1998 .

[39]  Paolo Liberatore,et al.  The Complexity of Belief Update , 1997, IJCAI.

[40]  David Makinson.  Propositional Relevance through Letter-Sharing: Review and Contribution , 2007, Formal Models of Belief Change in Rational Agents.

[41]  Pierre Marquis,et al.  Consequence Finding Algorithms , 2000 .

[42]  David Makinson,et al.  Parallel interpolation, splitting, and relevance in belief change , 2007, Journal of Symbolic Logic.

[43]  Jérôme Lang,et al.  Belief extrapolation (or how to reason about observations and unpredicted change) , 2002, Artif. Intell..

[44]  Pierre Marquis,et al.  Conditional independence in propositional logic , 2002, Artif. Intell..

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

[46]  Pierre Marquis,et al.  Knowledge Compilation in the Modal Logic S5 , 2010, AAAI.

[47]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[48]  Piergiorgio Bertoli,et al.  Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection , 2009, J. Artif. Intell. Res..

[49]  Guram Bezhanishvili,et al.  Logic, Language, and Computation , 2009, Lecture Notes in Computer Science.

[50]  Andreas Herzig,et al.  Propositional Belief Base Update and Minimal Change , 1999, Artif. Intell..

[51]  Andreas Herzig,et al.  Update Operations: A Review , 1998, ECAI.

[52]  Fangzhen Lin,et al.  How to Progress a Database (and Why) I. Logical Foundations , 1994, KR.

[53]  Carsten Lutz,et al.  Updating Description Logic ABoxes , 2006, KR.

[54]  Fangzhen Lin,et al.  How to Progress a Database , 1997, Artif. Intell..

[55]  Jérôme Lang,et al.  Belief Update Revisited , 2007, IJCAI.

[56]  Hector J. Levesque.  A Completeness Result for Reasoning with Incomplete First-Order Knowledge Bases , 1998, KR.

[57]  Patrick Doherty,et al.  The PMA and Relativizing Minimal Change for Action Update , 1998, Fundam. Informaticae.

[58]  Eyal Amir,et al.  First-Order Logical Filtering , 2005, IJCAI.

[59]  Yan Zhang,et al.  Knowledge forgetting: Properties and applications , 2009, Artif. Intell..

[60]  Pierre Marquis,et al.  Two Forms of Dependence in Propositional Logic: Controllability and Definability , 1998, AAAI/IAAI.

[61]  Thomas Eiter,et al.  Updating action domain descriptions☆ , 2005, IJCAI.

[62]  Eyal Amir,et al.  Logical Filtering , 2003, IJCAI.