Decomposition of declarative knowledge bases with external functions

Authors:
Thomas Eiter;Michael Fink;Thomas Krennwallner
Affiliations:
Institute of Information Systems, Vienna University of Technology, Vienna, Austria;Institute of Information Systems, Vienna University of Technology, Vienna, Austria;Institute of Information Systems, Vienna University of Technology, Vienna, Austria
Venue:
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Year:
2009

Citing 6
Cited 4

Splitting a logic program

Proceedings of the eleventh international conference on Logic programming
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Heterogeneous Agent Systems

Heterogeneous Agent Systems
On the existence of stable models of non-stratified logic programs

Theory and Practice of Logic Programming
Combining answer set programming with description logics for the Semantic Web

Artificial Intelligence
Effective integration of declarative rules with external evaluations for semantic-web reasoning

ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications

Realizing Default Logic over Description Logic Knowledge Bases

ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Combining nonmonotonic knowledge bases with external sources

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Pushing efficient evaluation of HEX programs by modular decomposition

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Uniform evaluation of nonmonotonic DL-Programs

FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.