Talks and Poster Presentations (with Proceedings-Entry):
M. Morak, N. Musliu, R. Pichler, St. Rümmele, S. Woltran:
"A New Tree-Decomposition Based Algorithm for Answer Set Programming";
Poster: 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence,
Boca Raton, Florida USA;
2011-11-07
- 2011-11-09; in: "2011 IEEE 23rd International Conference on Tools with Artificial Intelligence",
T. M. Khoshgoftaar, X. Zhu (ed.);
(2011),
ISSN: 1082-3409;
916
- 918.
English 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.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1109/ICTAI.2011.154
Created from the Publication Database of the Vienna University of Technology.