A Dynamic-Programming Based ASP-Solver

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.

Authors

• Michael Morak
• Reinhard Pichler
• Stefan Rümmele
• Stefan Woltran

Keywords

No keywords are indexed for this paper.