The Community for Technology Leaders
RSS Icon
Subscribe
Boca Raton, Florida USA
Nov. 7, 2011 to Nov. 9, 2011
ISBN: 978-0-7695-4596-7
pp: 916-918
ABSTRACT
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.
INDEX TERMS
dynamic programming, answer set programming, tree decomposition
CITATION
Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran, "A New Tree-Decomposition Based Algorithm for Answer Set Programming", ICTAI, 2011, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence 2011, pp. 916-918, doi:10.1109/ICTAI.2011.154
57 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool