Talks and Poster Presentations (with Proceedings-Entry):

M. Morak, N. Musliu, R. Pichler, St. Rümmele, S. Woltran:
"Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming";
Talk: Learning and Intelligent OptimizatioN Conference LION, Paris, Frankreich; 01-16-2012 - 01-20-2012; in: "Lecture Notes in Computer Science", Y. Hamadi, M. Schoenauer (ed.); Springer, 7219 (2012), ISBN: 978-3-642-34412-1; 130 - 144.

English abstract:
A promising approach to tackle intractable problems is given by a combination of decomposition methods with dynamic algorithms. One such decomposition concept is tree decomposition. However, several heuristics for obtaining a tree decomposition exist and, moreover, also the subsequent dynamic algorithm can be laid out differently. In this paper, we provide an experimental evaluation of this combined approach when applied to reasoning problems in propositional answer set programming. More specifically, we analyze the performance of three different heuristics and two different dynamic algorithms, an existing standard version and a recently proposed algorithm based on a more involved data structure, but which provides better theoretical runtime. The results suggest that a suitable combination of the tree decomposition heuristics and the dynamic algorithm has to be chosen carefully. In particular, we observed that the performance of the dynamic algorithm highly depends on certain features (besides treewidth) of the provided tree decomposition. Based on this observation we apply supervised machine learning techniques to automatically select the dynamic algorithm depending on the features of the input tree decomposition.

"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)

Created from the Publication Database of the Vienna University of Technology.