Skip to main content
SpringerLink
Log in

Tableau Calculi for Answer Set Programming

  • Conference paper
Logic Programming (ICLP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4079))

Included in the following conference series:

Abstract

We introduce a formal proof system based on tableau methods for analyzing computations made in Answer Set Programming (ASP). Our approach furnishes declarative and fine-grained instruments for characterizing operations as well as strategies of ASP-solvers. First, the granulation is detailed enough to capture the variety of propagation and choice operations of algorithms used for ASP; this also includes SAT-based approaches. Second, it is general enough to encompass the various strategies pursued by existing ASP-solvers. This provides us with a uniform framework for identifying and comparing fundamental properties of algorithms. Third, the approach allows us to investigate the proof complexity of algorithms for ASP, depending on choice operations. We show that exponentially different best-case computations can be obtained for different ASP-solvers. Finally, our approach is flexible enough to integrate new inference patterns, so to study their relation to existing ones. As a result, we obtain a novel approach to unfounded set handling based on loops, being applicable to non-SAT-based solvers. Furthermore, we identify backward propagation operations for unfounded sets.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  2. Mitchell, D.: A SAT solver primer. Bulletin of the European Association for Theoretical Computer Science 85, 112–133 (2005)

    MATH  Google Scholar 

  3. Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157(1-2), 115–137 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Giunchiglia, E., Lierler, Y., Maratea, M.: A SAT-based polynomial space algorithm for answer set programming. In: Delgrande, J., Schaub, T. (eds.) Proceedings of the Tenth International Workshop on Non-Monotonic Reasoning, pp. 189–196 (2004)

    Google Scholar 

  5. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181–234 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Faber, W.: Enhancing Efficiency and Expressiveness in Answer Set Programming Systems. Dissertation, Technische Universität Wien (2002)

    Google Scholar 

  7. Anger, C., Gebser, M., Linke, T., Neumann, A., Schaub, T.: The nomore++ approach to answer set solving. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS, vol. 3835, pp. 95–109. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. D’Agostino, M., Gabbay, D., Hähnle, R., Posegga, J. (eds.): Handbook of Tableau Methods. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  9. Leone, N., Faber, W., Pfeifer, G., Eiter, T., Gottlob, G., Koch, C., Mateis, C., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic (to appear, 2006)

    Google Scholar 

  10. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7, 201–215 (1960)

    Article  MATH  MathSciNet  Google Scholar 

  11. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM 5, 394–397 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  12. Järvisalo, M., Junttila, T., Niemelä, I.: Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Mathematics and Artificial Intelligence 44(4), 373–399 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Junttila, T.A., Niemelä, I.: Towards an efficient tableau method for boolean circuit satisfiability checking. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J., et al. (eds.) CL 2000. LNCS, vol. 1861, pp. 553–567. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Beame, P., Pitassi, T.: Propositional proof complexity: Past, present, and future. Bulletin of the European Association for Theoretical Computer Science 65, 66–89 (1998)

    MATH  MathSciNet  Google Scholar 

  15. Hähnle, R.: Tableaux and related methods. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 100–178. Elsevier and MIT Press (2001)

    Google Scholar 

  16. Fitting, M.: Tableaux for logic programming. J. Automated Reasoning 13(2), 175–188 (1994)

    Article  MathSciNet  Google Scholar 

  17. Pearce, D., de Guzmán, I., Valverde, A.: A tableau calculus for equilibrium entailment. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS, vol. 1847, pp. 352–367. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  18. Olivetti, N.: Tableaux for nonmonotonic logics. In: [8], pp. 469–528

    Google Scholar 

  19. Bonatti, P.: Resolution for skeptical stable model semantics. J. Automated Reasoning 27(4), 391–421 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  20. Calimeri, F., Faber, W., Leone, N., Pfeifer, G.: Pruning operators for answer set programming systems. Technical Report INFSYS RR-1843-01-07, Technische Universität Wien (2001)

    Google Scholar 

  21. van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620–650 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  22. Lee, J.: A model-theoretic counterpart of loop formulas. In: Kaelbling, L., Saffiotti, A. (eds.) Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Professional Book Center, pp. 503–508 (2005)

    Google Scholar 

  23. Fitting, M.: Fixpoint semantics for logic programming: A survey. Theoretical Computer Science 278(1-2), 25–51 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  24. Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293–322. Plenum Press, New York (1978)

    Google Scholar 

  25. Apt, K., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In: Minker, J. (ed.) Found. of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufmann, San Francisco (1987)

    Google Scholar 

  26. Lifschitz, V., Razborov, A.: Why are there so many loop formulas? ACM Transactions on Computational Logic (to appear, 2006)

    Google Scholar 

  27. Fages, F.: Consistency of Clark’s completion and the existence of stable models. Journal of Methods of Logic in Computer Science 1, 51–60 (1994)

    Google Scholar 

  28. Babovich, Y., Lifschitz, V.: Computing answer sets using program completion. Draft (2003)

    Google Scholar 

  29. Giunchiglia, E., Maratea, M.: On the relation between answer set and SAT procedures (or, between cmodels and smodels). In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 37–51. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  30. Konczak, K., Linke, T., Schaub, T.: Graphs and colorings for answer set programming. Theory and Practice of Logic Programming 6(1-2), 61–106 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  31. Anger, C., Gebser, M., Schaub, T.: What’s a head without a body. In: Brewka, G. (ed.) Proceedings of the Seventeenth European Conference on Artificial Intelligence. IOS Press, Amsterdam (to appear, 2006)

    Google Scholar 

  32. Simons, P.: Extending and Implementing the Stable Model Semantics. Dissertation, Helsinki University of Technology (2000)

    Google Scholar 

  33. Anger, C., Gebser, M., Schaub, T.: Approaching the core of unfounded sets. In: Dix, J., Hunter, A. (eds.) Proceedings of the Eleventh International Workshop on Non-Monotonic Reasoning (to appear, 2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Potsdam, Postfach 90 03 27, D–14439, Potsdam

    Martin Gebser & Torsten Schaub

Authors
  1. Martin Gebser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Torsten Schaub
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Twente, The Netherlands

    Sandro Etalle

  2. Department of Computer Science, University of Kentucky, 40506, Lexington, KY, USA

    Mirosław Truszczyński

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gebser, M., Schaub, T. (2006). Tableau Calculi for Answer Set Programming. In: Etalle, S., Truszczyński, M. (eds) Logic Programming. ICLP 2006. Lecture Notes in Computer Science, vol 4079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11799573_4

Download citation

  • DOI: https://doi.org/10.1007/11799573_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36635-5

  • Online ISBN: 978-3-540-36636-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation