Complexity of Model Checking for Cardinality-Based Belief Revision Operators

This paper deals with the complexity of model checking for belief base revision. We extend the study initiated by Liberatore & Schaerf and introduce two new belief base revision operators stemming from consistent subbases maximal with respect to cardinality. We establish the complexity of the model checking problem for various operators within the framework of propositional logic as well as in the Horn fragment.

[1]  Peter Gärdenfors,et al.  Belief Revision and Nonmonotonic Logic: Two Sides of the Same Coin? (Abstract) , 1990, JELIA.

[2]  Nadia Creignou,et al.  A Complete Classification of the Complexity of Propositional Abduction , 2006, SIAM J. Comput..

[3]  Sven Ove Hansson,et al.  Revision of Belief Sets and Belief Bases , 1998 .

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[6]  Thomas Schiex,et al.  Nonmonotonic reasoning: from complexity to algorithms , 1998, Annals of Mathematics and Artificial Intelligence.

[7]  Marianne Winslett.  Sometimes Updates Are Circumscription , 1989, IJCAI.

[8]  Odile Papini,et al.  An answer set programming encoding of Prioritized Removed Sets Revision: application to GIS , 2008, Applied Intelligence.

[9]  Odile Papini.  A Complete Revision Function in Propositional Calculus , 1992, ECAI.

[10]  Stefan Woltran,et al.  Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? , 2013, IJCAI.

[11]  Bernhard Nebel,et al.  Belief Revision and Default Reasoning: Syntax-Based Approaches , 1991, KR.

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

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

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

[15]  Daniel Lehmann,et al.  Belief Revision, Revised , 1995, IJCAI.

[16]  Klaus W. Wagner.  More Complicated Questions About Maxima and Minima, and Some Closures of NP , 1987, Theor. Comput. Sci..

[17]  Didier Dubois,et al.  Inconsistency Management and Prioritized Syntax-Based Entailment , 1993, IJCAI.

[18]  Georg Gottlob,et al.  On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals , 1992, Artif. Intell..

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