Proceedings

Decomposition of Declarative Knowledge Bases with External Functions

Download BibTeX Cite

Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 752-757.

© 2009 International Joint Conferences on Artificial Intelligence

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, which we demonstrate by an evaluation method for HEX-programs based on program rewriting. Experiments show that this 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.Thomas Eiter, Michael Fink, Thomas Krennwallner

  1. [Abiteboul et al., 1995] S. Abiteboul, R. Hull, and V. Vianu. Foun- dations of Databases. Addison-Wesley, 1995.
  2. [Cohen and Jeavons, 2003] D. Cohen and P. Jeavons. Constraint Processing, R. Dechter (ed.), chapter Tractable Constraint Lan- guages. Morgan Kaufmann, 2003.
  3. [Costantini, 2006] S. Costantini. On the existence of stable models of non-stratified logic programs. Theory Pract. Log. Program., 6(1-2):169-212, 2006.
  4. [Eiter et al., 2006a] T. Eiter, G. Ianni, R. Schindlauer, and H. Tom- pits. Effective Integration of Declarative Rules with external Evaluations for Semantic Web Reasoning. In ESWC'06, pp. 273- 287. Springer, 2006.
  5. [Eiter et al., 2006b] T. Eiter, G. Ianni, R. Schindlauer, and H. Tom- pits. Towards efficient evaluation of HEX programs. In NMR'06, pp. 40-46. 2006.
  6. [Eiter et al., 2008] T. Eiter, G. Ianni, T. Lukasiewicz, R. Schind- lauer, and H. Tompits. Combining answer set programming with description logics for the semantic web. Artif. Intell., 172(12- 13):1495-1539, 2008.
  7. [Faber et al., 2004] W. Faber, N. Leone, and G. Pfeifer. Recursive aggregates in disjunctive logic programs: semantics and com- plexity. In JELIA'04, pp. 200-212. Springer, 2004.
  8. [Gelfond and Lifschitz, 1991] M. Gelfond and V. Lifschitz. Clas- sical negation in logic programs and disjunctive databases. New Gener. Comput., 9:365-385, 1991.
  9. [Lifschitz and Turner, 1994] V. Lifschitz and H. Turner. Splitting a logic program. In ICLP'94, pp. 23-37. MIT Press, 1994.
  10. [Subrahmanian et al., 2000] V.S. Subrahmanian, P. Bonatti, J. Dix, T. Eiter, S. Kraus, F. Ozcan, and R. Ross. Heterogeneous Agent Systems: Theory and Implementation. MIT Press, 2000.
  11. [Wang et al., 2004] K. Wang, D. Billington, J. Blee, and G. Anto- niou. Combining description logic and defeasible logic for the Semantic Web. In RuleML'04, pp. 170-181. Springer, 2004.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards