Knowledge Forgetting in Circumscription: A Preliminary Report

The theory of (variable) forgetting has received significant attention in nonmonotonic reasoning, especially, in answer set programming. However, the problem of establishing a theory of forgetting for some expressive nonmonotonic logics such as McCarthy's circumscription is rarely explored. In this paper a theory of forgetting for propositional circumscription is proposed, which is not a straightforward adaption of existing approaches. In particular, some properties that are essential for existing proposals do not hold any longer or have to be reformulated. Several useful properties of the new forgetting are proved, which demonstrate suitability of the forgetting for circumscription. A sound and complete algorithm for the forgetting is developed and an analysis of computational complexity is given.

[1]  Kewen Wang,et al.  Forgetting for Answer Set Programs Revisited , 2013, IJCAI.

[2]  Fangzhen Lin,et al.  On strongest necessary and weakest sufficient conditions , 2000, Artif. Intell..

[3]  Jeff Z. Pan,et al.  ELIMINATING CONCEPTS AND ROLES FROM ONTOLOGIES IN EXPRESSIVE DESCRIPTIVE LOGICS , 2014, Comput. Intell..

[4]  Carsten Lutz,et al.  Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics , 2011, IJCAI.

[5]  Jessika Schulze,et al.  Handbook Of Logic In Artificial Intelligence And Logic Programming , 2016 .

[6]  Dov M. Gabbay,et al.  Handbook of logic in artificial intelligence and logic programming (vol. 1) , 1993 .

[7]  Georg Gottlob,et al.  Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014 , 2014, KR.

[8]  Pierre Marquis,et al.  Reasoning under inconsistency: A forgetting-based approach , 2010, Artif. Intell..

[9]  Fangzhen Lin,et al.  Loop formulas for circumscription , 2004, Artif. Intell..

[10]  Frank Wolter,et al.  Handbook of Modal Logic, Volume 3 (Studies in Logic and Practical Reasoning) , 2006 .

[11]  Dov M. Gabbay,et al.  Interpolable Formulas in Equilibrium Logic and Answer Set Programming , 2011, J. Artif. Intell. Res..

[12]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[13]  Norman Y. Foo,et al.  Solving Logic Program Conflict through Strong and Weak Forgettings , 2005, IJCAI.

[14]  Christoph Wernhard.  Projection and scope-determined circumscription , 2012, J. Symb. Comput..

[15]  Yongmei Liu,et al.  On the Progression of Knowledge in the Situation Calculus , 2011, IJCAI.

[16]  Marco Cadoli,et al.  The Complexity of Model Checking for Circumscriptive Formulae , 1992, Inf. Process. Lett..

[17]  Hector J. Levesque,et al.  Forgetting in Action , 2014, KR.

[18]  Gerhard Lakemeyer,et al.  Relevance from an Epistemic Perspective , 1997, Artif. Intell..

[19]  R. Reiter,et al.  Forget It ! , 1994 .

[20]  Patrick Doherty,et al.  Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas , 2001, IJCAI.

[21]  Frank Wolter,et al.  Can You Tell the Difference Between DL-Lite Ontologies? , 2008, KR.

[22]  Yves Moinard,et al.  Forgetting Literals with Varying Propositional Symbols , 2007, J. Log. Comput..

[23]  Eyal Amir,et al.  Interpolation Theorems for Nonmonotonic Reasoning Systems , 2002, JELIA.

[24]  Kewen Wang,et al.  Semantic forgetting in answer set programming , 2008, Artif. Intell..

[25]  Carsten Lutz,et al.  The Complexity of Circumscription in DLs , 2009, J. Artif. Intell. Res..

[26]  Frank Wolter,et al.  Handbook of Modal Logic , 2007, Studies in logic and practical reasoning.

[27]  M. Helmert,et al.  Principles of Knowledge Representation and Reasoning , 2008 .

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

[29]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[30]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[31]  Vladimir Lifschitz,et al.  Computing Circumscription , 1985, IJCAI.

[32]  Georg Gottlob,et al.  Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete , 1993, Theor. Comput. Sci..

[33]  Jeff Z. Pan,et al.  Forgetting for knowledge bases in DL-Lite , 2010, Annals of Mathematics and Artificial Intelligence.

[34]  J. McCarthy.  CIRCUMSCRIPTION — A FORM OF NONMONOTONIC REASONING , 2007 .

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

[36]  Kewen Wang,et al.  A Syntax-Independent Approach to Forgetting in Disjunctive Logic Programs , 2015, AAAI.

[37]  Yi Zhou,et al.  Knowledge Forgetting in Answer Set Programming , 2014, J. Artif. Intell. Res..