[Back]

M. Abseher, B. Bliem, G. Charwat, F. Dusberger, M. Hecher, S. Woltran:
"D-FLAT: Progress Report";
Report for TU Wien, Institut fuer Informationssysteme; Report No. DBAI-TR-2014-86, 2014; 57 pages.

Complex reasoning problems over large amounts of data pose a great challenge for Artificial Intelligence and Knowledge Representation. To cope with it, it is desirable to use declarative approaches, as these offer high maintainability and are often easy to use for domain experts. Especially Answer Set Programming (ASP) has become prominent due to the existence of powerful solvers that offer high efficiency and rich modeling languages. 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 ASP 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 report, we give a comprehensive overview of our software and provide many examples to illustrate its versatility.

http://dbai.tuwien.ac.at/research/report/dbai-tr-2014-86.pdf

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