Skip to Content

TU Wien Fakultät für Informatik DBAI Database and Artificial Intelligence Group
Top-level Navigation: Current-level Navigation:

Path: DBAI > Research > Projects > D-FLAT Project > Software > D-FLAT System

Tools: Print

D-FLAT System

A free software framework for rapid development of ASP-encoded dynamic programming algorithms that are based on tree decompositions. D-FLAT is developed within the project "Extending the Answer-Set Programming Paradigm to Decomposed Problem Solving".



D-FLAT (Dynamic Programming Framework with Local Execution of ASP on Tree Decompositions) is a tool that allows specification of dynamic programming algorithms operating on tree decompositions of a problem's (hyper)graph representation. This specification is done by means of logic programming under the answer set semantics. D-FLAT relieves the user from handling all the technical details concerned with parsing, tree decomposition, the handling of data structures, etc. Instead, it is only the dynamic programming algorithm itself which has to be specified in the ASP language. D-FLAT employs an ASP solver in order to compute the local solutions in the dynamic programming algorithm. It can therefore be used as a rapid prototyping tool for quickly implementing dynamic programming algorithms on tree decompositions.



D-FLAT provides a command line interface with options to specify the file containing the dynamic programming algorithm, heuristics used for obtaining the tree decomposition of the input instance, and various output options, among others. For details, invoke D-FLAT with option -h, or have a look at the documentation.

Running a simple 3-Col algorithm specified in the file 3col.lp, with the input graph in a file instance.lp and edges specified with the predicate edge/2, amounts to this call:

dflat -p 3col.lp -e edge < instance.lp

Example encodings



We provide different versions of D-FLAT as well as a collection of example D-FLAT encodings and input instances for download.

The current development version of D-FLAT can be found in the D-FLAT repository on Github.

Among the example encodings, we provide implementations of different semantics for argumentation frameworks (see, e.g., Argumentation Project). The monolithic encodings for the argumentation problems are taken from the ASPARTIX Project.

Version 1.2.5

All Versions

Example Instances

We provide a real world collection of traffic network instances, a downloader for instances which are in GTFS format, and a collection of instances of small treewidth for various problems, which was used for preliminary experiments.



People involved in the development of D-FLAT:

In case of questions, bug reports or comments, please send an e-mail to Bernhard Bliem.

Last updated: 2017-08-17 15:56

Home / Kontakt / Webmaster / Offenlegung gemäß § 25 Mediengesetz: Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. Disclaimer / Datenschutzerklärung