A New Tree-Decomposition Based Algorithm for Answer Set Programming
Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran · 2011
A promising approach to tackle intractable problems is given by combining decomposition methods with dynamic programming algorithms. One such decomposition concept is tree decomposition. In this paper, we provide a new algorithm using this combined approach for solving reasoning problems in propositional answer set programming.