Pushing Efficient Evaluation of HEX Programs by Modular Decomposition

  • Thomas Eiter
  • Michael Fink
  • Giovambattista Ianni
  • Thomas Krennwallner
  • Peter Schüller
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6645)

Abstract

The evaluation of logic programs with access to external knowledge sources requires to interleave external computation and model building. Deciding where and how to stop with one task and proceed with the next is a difficult problem, and existing approaches have severe scalability limitations in many real-world application scenarios. We introduce a new approach for organizing the evaluation of logic programs with external knowledge sources and describe a configurable framework for dividing the non-ground program into overlapping possibly smaller parts called evaluation units. These units will then be processed by interleaving external evaluations and model building according to an evaluation and a model graph, and by combining intermediate results. Experiments with our prototype implementation show a significant improvement of this technique compared to existing approaches. Interestingly, even for ordinary logic programs (with no external access), our decomposition approach speeds up existing state of the art ASP solvers in some cases, showing its potential for wider usage.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Amir, E., McIlraith, S.: Partition-based logical reasoning for first-order and propositional theories. Artif. Intell. 162(1-2), 49–88 (2005)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Brewka, G., Eiter, T.: Equilibria in heterogeneous nonmonotonic multi-context systems. In: AAAI 2007, pp. 385–390. AAAI Press, Menlo Park (2007)Google Scholar
  3. 3.
    Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Computable functions in ASP: Theory and implementation. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 407–424. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Eiter, T., Fink, M., Krennwallner, T.: Decomposition of Declarative Knowledge Bases with External Functions. In: IJCAI 2009, pp. 752–758. AAAI Press, Menlo Park (2009)Google Scholar
  5. 5.
    Eiter, T., Ianni, G., Krennwallner, T., Schindlauer, R.: Exploiting conjunctive queries in description logic programs. Ann. Math. Artif. Intell. 53(1-4), 115–152 (2008)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: A uniform integration of higher-order reasoning and external evaluations in answer-set programming. In: IJCAI 2005, pp. 90–96 (2005)Google Scholar
  7. 7.
    Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: Effective integration of declarative rules with external evaluations for semantic-web reasoning. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, vol. 4011, pp. 273–287. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Faber, W., Leone, N., Pfeifer, G.: Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell. 175(1), 278–298 (2011)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Gebser, M., Kaufmann, B., Schaub, T.: Solution enumeration for projected boolean search problems. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 71–86. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  10. 10.
    Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. Next Generat. Comput. 9(3-4), 365–386 (1991)CrossRefMATHGoogle Scholar
  11. 11.
    Hoehndorf, R., Loebe, F., Kelso, J., Herre, H.: Representing default knowledge in biomedical ontologies: Application to the integration of anatomy and phenotype ontologies. BMC Bioinf. 8(1), 377 (2007), doi:10.1186/1471-2105-8-377CrossRefGoogle Scholar
  12. 12.
    Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity Aspects of Disjunctive Stable Models. J. Artif. Intell. Res. 35, 813–857 (2009), doi:10.1613/jair.2810MathSciNetMATHGoogle Scholar
  13. 13.
    Lifschitz, V., Turner, H.: Splitting a Logic Program. In: ICLP 1994, pp. 23–38. MIT Press, Cambridge (1994)Google Scholar
  14. 14.
    Van Nieuwenborgh, D., Eiter, T., Hadavandi, E.: Conditional planning with external functions. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 214–227. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  15. 15.
    Oikarinen, E., Janhunen, T.: Achieving compositionality of the stable model semantics for smodels programs. Theory Pract. Log. Prog. 8(5-6), 717–761 (2008)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Perri, S., Ricca, F., Sirianni, M.: A parallel ASP instantiator based on DLV. In: DAMP 2010, pp. 73–82. Springer, Heidelberg (2010)Google Scholar
  17. 17.
    Polleres, A.: From SPARQL to rules (and back). In: WWW 2007, pp. 787–796. ACM, New York (2007)Google Scholar
  18. 18.
    Przymusinski, T.C.: On the Declarative Semantics of Deductive Databases and Logic Programs. In: Foundations of Deductive Databases and Logic Programming, pp. 193–216 (1988)Google Scholar
  19. 19.
    Ross, K.: Modular Stratification and Magic Sets for Datalog Programs with Negation. J. ACM 41(6), 1216–1267 (1994)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Schindlauer, R.: Answer-set programming for the Semantic Web. Ph.D. thesis, Vienna University of Technology (2006)Google Scholar
  21. 21.
    Zirtiloǧlu, H., Yolum, P.: Ranking semantic information for e-government: complaints management. In: OBI 2008, vol. (5), pp. 1–7. ACM, New York (2008), doi:10.1145/1452567.1452572Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Thomas Eiter
    • 1
  • Michael Fink
    • 1
  • Giovambattista Ianni
    • 2
  • Thomas Krennwallner
    • 1
  • Peter Schüller
    • 1
  1. 1.Institut für InformationssystemeTechnische Universität WienViennaAustria
  2. 2.Dipartimento di Matematica, Cubo 30BUniversità della CalabriaRendeItaly

Personalised recommendations