Answer Set Solving using Tree Decompositions and Dynamic Programming — The DynASP 2 System —

While the solution counting problem for propositional satisfiability (#SAT) has received renewed attention in recent years, this research trend has not affected other AI solving paradigms like answer set programming (ASP). Although ASP solvers are designed to enumerate all solutions, and counting can therefore be easily done, the involved materialization of… CONTINUE READING