Forgetting under the Well-Founded Semantics

In this paper, we develop a notion of forgetting for normal logic programs under the well-founded semantics. We show that a number of desirable properties are satisfied by our approach. Three different algorithms are presented that maintain the computational complexity of the well-founded semantics, while partly keeping its syntactical structure.

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

[2]  Jürgen Dix,et al.  Transformation-based bottom-up computation of the well-founded model , 1996, Theory and Practice of Logic Programming.

[3]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

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

[5]  Andreas Herzig,et al.  Introspective forgetting , 2008, Synthese.

[6]  João Leite,et al.  On Semantic Update Operators for Answer-Set Programs , 2010, ECAI.

[7]  Stefan Woltran,et al.  Semantical characterizations and complexity of equivalences in answer set programming , 2005, TOCL.

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

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

[10]  Zili Zhang,et al.  A generalized joint inference approach for citation matching , 2008 .

[11]  Yi Zhou,et al.  Bounded Forgetting , 2011, AAAI.

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

[13]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[14]  K. A. Ross,et al.  Tabled Evaluation with Delaying for General Logic Programs , 1996 .

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

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

[17]  Kewen Wang,et al.  Forgetting for Defeasible Logic , 2012, LPAR.

[18]  Yi Zhou,et al.  Forgetting in Logic Programs under Strong Equivalence , 2012, KR.

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

[20]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[21]  Jürgen Dix,et al.  Semantics of (disjunctive) Logic Programs Based on Partial Evaluation , 1999, J. Log. Program..

[22]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[23]  David Pearce,et al.  Logical Foundations of Well-Founded Semantics , 2006, KR.

[24]  Frank Wolter,et al.  Logic-based ontology comparison and module extraction, with an application to DL-Lite , 2010, Artif. Intell..

[25]  José Júlio Alferes,et al.  Local closed world reasoning with description logics under the well-founded semantics , 2011, Artif. Intell..

[26]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.