Advertisement

Stepwise Debugging of Description-Logic Programs

  • Johannes Oetsch
  • Jörg Pührer
  • Hans Tompits
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7265)

Abstract

Description-logic programs (or DL-programs for short) combine logic programs under the answer-set semantics with description logics for semantic-web reasoning. In order for a wider acceptance of the formalism among semantic-web engineers, it is vital to have adequate tools supporting the program development process. In particular, methods for debugging DL-programs are needed. In this paper, we introduce a framework for interactive stepping through a DL-program as a means for debugging which builds on recent results on stepping for standard answer-set programs. To this end, we provide a computation model for DL-programs using states based on the rules that a user considers as active in the program and the resulting intermediate interpretation. During the course of stepping, the interpretations of the subsequent states evolve towards an answer set of the overall program. Compared to the case of standard answer-set programs, we need more involved notions of states and computations in the presence of DL-atoms. In particular, if non-convex DL-atoms are involved, we have to allow for non-stable computations. Intuitively speaking, we realise this by allowing the user to assume the truth of propositional atoms which must be justified in subsequent states. To keep track of these additional atoms, we extend the well-known notion of an unfounded set for DL-programs.

Keywords

Logic Program Description Logic External Support Front Seat Extended Logic Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. Artificial Intelligence 172(12-13), 1495–1539 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Lifschitz, V.: What is answer set programming? In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI 2008), pp. 1594–1597. AAAI Press (2008)Google Scholar
  3. 3.
    Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.: The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press (2003)Google Scholar
  4. 4.
    Oetsch, J., Pührer, J., Tompits, H.: Stepping through an Answer-Set Program. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 134–147. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  5. 5.
    Faber, W., Pfeifer, G., Leone, N.: Semantics and complexity of recursive aggregates in answer set programming. Artificial Intelligence 175(1), 278–298 (2011)MathSciNetCrossRefzbMATHGoogle 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: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), Professional Book Center, pp. 90–96 (2005)Google Scholar
  7. 7.
    Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Proceedings of the 7th International Conference on Logic Programming (ICLP 1990), pp. 579–597 (1990)Google Scholar
  8. 8.
    Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3/4), 365–386 (1991)CrossRefzbMATHGoogle Scholar
  9. 9.
    Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K. (eds.) Proceedings of the 5th International Conference on Logic Programming (ICLP 1988), Seattle, WA, USA, pp. 1070–1080. MIT Press (1988)Google Scholar
  10. 10.
    Leone, N., Rullo, P., Scarcello, F.: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation 135(2), 69–112 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Faber, W.: Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 40–52. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  12. 12.
    Oetsch, J., Pührer, J., Tompits, H.: Catching the Ouroboros: On debugging non-ground answer-set programs. Theory and Practice of Logic Programming 10(4-5), 513–529 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Brain, M., Gebser, M., Pührer, J., Schaub, T., Tompits, H., Woltran, S.: Debugging ASP Programs by Means of ASP. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 31–43. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  14. 14.
    Pührer, J., El Ghali, A., Chniti, A., Korf, R., Schwichtenberg, A., Lévy, F., Heymans, S., Xiao, G., Eiter, T.: D2.3 Consistency maintenance. Intermediate report. Technical report, ONTORULE IST-2009-231875 Project (2010)Google Scholar
  15. 15.
    Pührer, J., Heymans, S., Eiter, T.: Dealing with Inconsistency When Combining Ontologies and Rules Using DL-Programs. In: Aroyo, L., Antoniou, G., Hyvönen, E., ten Teije, A., Stuckenschmidt, H., Cabral, L., Tudorache, T. (eds.) ESWC 2010. LNCS, vol. 6088, pp. 183–197. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  16. 16.
    Syrjänen, T.: Debugging inconsistent answer set programs. In: Proceedings of the 11th International Workshop on Non-Monotonic Reasoning (NMR 2006), Clausthal, Germany, Institut für Informatik, Technische Universität Clausthal, Technical Report, pp. 77–83 (2006)Google Scholar
  17. 17.
    Brain, M., De Vos, M.: Debugging logic programs under the answer-set semantics. In: Proceedings of the 3rd Workshop on Answer Set Programming: Advances in Theory and Implementation, ASP 2005. CEUR Workshop Proceedings, CEUR-WS.org, vol. 142, pp. 140–152 (2005)Google Scholar
  18. 18.
    Calimeri, F., Leone, N., Ricca, F., Veltri, P.: A visual tracer for DLV. In: Proceedings of the 2nd Workshop on Software Engineering for Answer Set Programming (SEA 2009), Technical Report 2009-20, University of Bath, pp. 79–93 (2009)Google Scholar
  19. 19.
    Pontelli, E., Son, T.C., El-Khatib, O.: Justifications for logic programs under answer set semantics. Theory and Practice of Logic Programming 9(1), 1–56 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Liu, L., Pontelli, E., Son, T.C., Truszczyski, M.: Logic programs with abstract constraint atoms: The role of computations. Artificial Intelligence 174(3-4), 295–315 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Wang, Y., You, J.H., Yuan, L.Y., Shen, Y.D., Zhang, M.: The loop formula based semantics of description logic programs. Theoretical Computer Science 415, 60–85 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Heymans, S., Eiter, T., Xiao, G.: Tractable reasoning with dl-programs over datalog-rewritable description logics. In: Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010). Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 35–40. IOS Press (2010)Google Scholar
  23. 23.
    McGuinness, D.L., Borgida, A.: Explaining subsumption in description logics. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995), pp. 816–821. Morgan Kaufmann (1995)Google Scholar
  24. 24.
    Borgida, A., Franconi, E., Horrocks, I.: Explaining ALC subsumption. In: Proceedings of the 1999 International Workshop on Description Logics (DL 1999). CEUR Workshop Proceedings, CEUR-WS.org, vol. 22, pp. 33–36 (1999)Google Scholar
  25. 25.
    Deng, X., Haarslev, V., Shiri, N.: A resolution based framework to explain reasoning in description logics. In: Proceedings of the 2005 International Workshop on Description Logics (DL 2005). CEUR Workshop Proceedings, CEUR-WS.org, vol. 147 (2005)Google Scholar
  26. 26.
    Schlobach, S., Cornet, R.: Non-standard reasoning services for the debugging of description logic terminologies. In: Gottlob, G., Walsh, T. (eds.) Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI 2003), pp. 355–362. Morgan Kaufmann (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Johannes Oetsch
    • 1
  • Jörg Pührer
    • 1
  • Hans Tompits
    • 1
  1. 1.Institut für Informationssysteme 184/3Technische Universität WienViennaAustria

Personalised recommendations