A Dynamic-Programming Based ASP-Solver

  • Michael Morak
  • Reinhard Pichler
  • Stefan Rümmele
  • Stefan Woltran
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6341)

Abstract

We present a novel system for propositional Answer-Set Programming (ASP). This system, called dynASP, is based on dynamic programming and thus significantly differs from standard ASP-solvers which implement techniques stemming from SAT or CSP.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczynski, M.: The second answer set programming competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 637–654. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  2. 2.
    Dermaku, A., Ganzow, T., Gottlob, G., McMahan, B.J., Musliu, N., Samer, M.: Heuristic methods for hypertree decomposition. In: Gelbukh, A., Morales, E.F. (eds.) MICAI 2008. LNCS (LNAI), vol. 5317, pp. 1–11. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  3. 3.
    Gottlob, G., Pichler, R., Wei, F.: Bounded treewidth as a key to tractability of knowledge representation and reasoning. In: Proc. AAAI 2006, pp. 250–256. AAAI Press, Menlo Park (2006)Google Scholar
  4. 4.
    Jakl, M., Pichler, R., Woltran, S.: Answer-set programming with bounded treewidth. In: Proc. IJCAI 2009, pp. 816–822. AAAI Press, Menlo Park (2009)Google Scholar
  5. 5.
    Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The dlv system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7(3), 499–562 (2006)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Marek, V.W., Truszczyński, M.: Stable Models and an Alternative Logic Programming Paradigm. In: The Logic Programming Paradigm – A 25-Year Perspective, pp. 375–398. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  7. 7.
    Niemelä, I.: Logic programming with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3-4), 241–273 (1999)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Pichler, R., Rümmele, S., Szeider, S., Woltran, S.: Tractable answer-set programming with weight constraints: Bounded treewidth is not enough. In: Proc. KR 2010, pp. 508–517. AAAI Press, Menlo Park (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Michael Morak
    • 1
  • Reinhard Pichler
    • 1
  • Stefan Rümmele
    • 1
  • Stefan Woltran
    • 1
  1. 1.Institut für Informationssysteme E184/2Technische Universität WienWienAustria

Personalised recommendations