Forgetting and Unfolding for Existential Rules

Existential rules, a family of expressive ontology languages, inherit desired expressive and reasoning properties from both description logics and logic programming. On the other hand, forgetting is a well studied operation for ontology reuse, obfuscation and analysis. Yet it is challenging to establish a theory of forgetting for existential rules. In this paper, we lay the foundation for a theory of forgetting for existential rules by developing a novel notion of unfolding. In particular, we introduce a definition of forgetting for existential rules in terms of query answering and provide a characterisation of forgetting by the unfolding. A result of forgetting may not be expressible in existential rules, and we then capture the expressibility of forgetting by a variant of boundedness. While the expressibility is undecidable in general, we identify a decidable fragment. Finally, we provide an algorithm for forgetting in this fragment.

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

[2]  Haim Gaifman,et al.  Decidable Optimization Problems for Database Logic Programs (Preliminary Report) , 1988, STOC 1988.

[3]  Carsten Lutz,et al.  An Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic EL , 2012, KR.

[4]  Jia-Huai You,et al.  On Forgetting Postulates in Answer Set Programming , 2015, IJCAI.

[5]  Matthias Knorr,et al.  The Ultimate Guide to Forgetting in Answer Set Programming , 2016, KR.

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

[7]  Renate A. Schmidt,et al.  Forgetting Concept and Role Symbols in ALCOIHµ+(∇, ⊓)-Ontologies , 2016, IJCAI.

[8]  Giorgio Orsi,et al.  Query Rewriting and Optimization for Ontological Databases , 2014, TODS.

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

[10]  Boris Konev,et al.  Forgetting and Uniform Interpolation in Large-Scale Description Logic Terminologies , 2009, IJCAI.

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

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

[13]  Boris Konev,et al.  Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey , 2016, RW.

[14]  Jeff Z. Pan,et al.  Forgetting Concepts in DL-Lite , 2008, ESWC.

[15]  Andrea Calì,et al.  A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.

[16]  Yi Zhou,et al.  First-Order Disjunctive Logic Programming vs Normal Logic Programming , 2015, IJCAI.

[17]  Michaël Thomazo,et al.  Sound, Complete, and Minimal Query Rewriting for Existential Rules , 2013, IJCAI.

[18]  Renate A. Schmidt,et al.  Forgetting Concept and Role Symbols in ALCOIH\mu+(\top, \sqcap)-Ontologies , 2016, Description Logics.

[19]  Boris Motik,et al.  Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies , 2013, J. Artif. Intell. Res..

[20]  Harry G. Mairson,et al.  Undecidable optimization problems for database logic programs , 1993, JACM.

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

[22]  Jean-François Baget,et al.  On rules with existential variables: Walking the decidability line , 2011, Artif. Intell..

[23]  Sebastian Rudolph,et al.  (Non-)Succinctness of uniform interpolants of general terminologies in the description logic EL , 2014, Artif. Intell..

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

[25]  Patrick Koopmann,et al.  Count and Forget : Uniform Interpolation of SHQ-Ontologies — Long Version ? , 2014 .

[26]  Ian Horrocks,et al.  Module Extraction in Expressive Ontology Languages via Datalog Reasoning , 2016, J. Artif. Intell. Res..

[27]  Marie-Laure Mugnier,et al.  On Bounded Positive Existential Rules , 2016, Description Logics.

[28]  Boris Konev,et al.  Practical Uniform Interpolation and Forgetting for ALC TBoxes with Applications to Logical Difference , 2014, KR.

[29]  Kewen Wang,et al.  DL-Lite Ontology Revision Based on An Alternative Semantic Characterization , 2015, ACM Trans. Comput. Log..