The D-FLAT System for Dynamic Programming on Tree Decompositions

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.

Authors

• Michael Abseher
• Bernhard Bliem
• Günther Charwat
• Frederico Dusberger
• Markus Hecher
• Stefan Woltran

Keywords

No keywords are indexed for this paper.