Skip to main content
SpringerLink
Log in

A Dynamic-Programming Based ASP-Solver

  • Conference paper
Book cover Logics in Artificial Intelligence (JELIA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6341))

Included in the following conference series:

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.

Supported by the Austrian Science Fund (FWF), project P20704-N18.

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. 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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. 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. 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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  7. Niemelä, I.: Logic programming with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3-4), 241–273 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Institut für Informationssysteme E184/2, Technische Universität Wien, Favoritenstr. 9–11, 1040, Wien, Austria

    Michael Morak, Reinhard Pichler, Stefan Rümmele & Stefan Woltran

Authors
  1. Michael Morak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Reinhard Pichler
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefan Rümmele
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Stefan Woltran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information and Computer Science, Aalto University, 00076, Aalto, Finland

    Tomi Janhunen  & Ilkka Niemelä  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Morak, M., Pichler, R., Rümmele, S., Woltran, S. (2010). A Dynamic-Programming Based ASP-Solver. In: Janhunen, T., Niemelä, I. (eds) Logics in Artificial Intelligence. JELIA 2010. Lecture Notes in Computer Science(), vol 6341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15675-5_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15675-5_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15674-8

  • Online ISBN: 978-3-642-15675-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation