A dynamic-programming based ASP-solver. 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.
Keywords for this software
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Fichte, Johannes Klaus; Szeider, Stefan: Backdoors to tractable answer set programming (2015)
- Morak, Michael; Pichler, Reinhard; Rümmele, Stefan; Woltran, Stefan: A dynamic-programming based ASP-solver (2010)