Decomposition of Declarative Knowledge Bases with External Functions

We present a method to decompose a declarative knowledge base, given by a logic program under Answer Set Semantics with access to external sources. It overcomes the ineffectiveness of current methods due to a lack of structural information about these sources, viewed as black boxes, by exploiting independency information in accesses to them. To this end, we develop a generic notion of domain independence that allows to restrict the evaluation domain and, as a consequence, to prune unnecessary dependency assumptions between atoms. This leads to increased decomposability; we demonstrate this by an evaluation method for HEX-programs based on program rewriting, which may yield large performance gains. While developed for a particular formalism, the notions and ideas of this paper might be adapted to related formalisms as well.

[1]  Marco Cadoli,et al.  A Survey on Knowledge Compilation , 1997, AI Commun..

[2]  Stefania Costantini,et al.  Under Consideration for Publication in Theory and Practice of Logic Programming on the Existence of Stable Models of Non-stratified Logic Programs , 2022 .

[3]  Alan L. Rector,et al.  Modularisation of domain ontologies implemented in description logics and related formalisms including OWL , 2003, K-CAP '03.

[4]  Ian Horrocks,et al.  A Conjunctive Query Language for Description Logic Aboxes , 2000, AAAI/IAAI.

[5]  David Cohen.  chapter 11 – Tractable Constraint Languages , 2003 .

[6]  Hans Tompits,et al.  Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning , 2006, ESWC.

[7]  Diego Calvanese,et al.  Dwq : Esprit Long Term Research Project, No 22469 on the Decidability of Query Containment under Constraints on the Decidability of Query Containment under Constraints , 2022 .

[8]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[9]  Sheila A. McIlraith,et al.  Theorem Proving with Structured Theories , 2001, IJCAI.

[10]  James A. Hendler,et al.  Dynamic Ontologies on the Web , 2000, AAAI/IAAI.

[11]  Kewen Wang,et al.  Combining Description Logic and Defeasible Logic for the Semantic Web , 2004, RuleML.

[12]  Jay Banerjee,et al.  Semantics and implementation of schema evolution in object-oriented databases , 1987, SIGMOD '87.

[13]  Wolfgang Faber,et al.  Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity , 2004, JELIA.

[14]  Roman Barták,et al.  Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.

[15]  Francesco M. Donini,et al.  Reasoning in description logics , 1997 .

[16]  Natalya F. Noy,et al.  A Component-Based Framework For Ontology Evolution , 2003 .

[17]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

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

[19]  Alon Y. Halevy,et al.  Answering queries using views: A survey , 2001, The VLDB Journal.

[20]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[21]  Michel C. A. Klein,et al.  Ontology Versioning and Change Detection on the Web , 2002, EKAW.

[22]  Enrico Franconi,et al.  A Semantic Approach for Schema Evolution and Versioning in Object-Oriented Databases , 2000, Computational Logic.

[23]  Hans Tompits,et al.  Combining answer set programming with description logics for the Semantic Web , 2004, Artif. Intell..