Talks and Poster Presentations (with Proceedings-Entry):

M. Abseher, B. Bliem, G. Charwat, F. Dusberger, M. Hecher, S. Woltran:
"The D-FLAT System for Dynamic Programming on Tree Decompositions.";
Talk: European Conference on Logics in Artificial Intelligence (JELIA), Madeira; 09-24-2014 - 09-26-2014; in: "Logics in Artificial Intelligence - 14th European Conference, JELIA 2014", E. Fermé, J. Leite (ed.); Springer, (2014), ISSN: 0302-9743; 558 - 572.

English abstract:
Complex reasoning problems over large amounts of data pose a great challenge for computer science. To overcome the obstacle of high computational complexity, exploiting structure by means of tree decompositions has proved to be effective in many cases. However, the implementation of suitable efficient algorithms is often tedious. D-FLAT is a software system that combines the logic programming language Answer Set Programming with problem solving on tree decompositions and can serve as a rapid prototyping tool for such algorithms. Since we initially proposed D-FLAT, we have made major changes to the system, improving its range of applicability and its usability. In this paper, we present the system resulting from these efforts.

Answer Set Programming, tree decompositions, treewidth

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

Related Projects:
Project Head Stefan Woltran:
Answer-Set Programming Erweiterungen für Problemlösungen auf Zerlegungen

Project Head Stefan Woltran:

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