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".


Contents


News

Version 1.2.0

2015-06-02

Version 1.2.0 of D-FLAT is now available for download. Detailed documentation is published in the DBAI Technical Report DBAI-TR-2014-86, including a system overview, example encodings, and a description of the D-FLAT Debugger. This version adds several new features.

Version 1.1.0

2015-06-22

Version 1.1.0 of D-FLAT is now available for download. Detailed documentation is published in the DBAI Technical Report DBAI-TR-2014-86, including a system overview, example encodings, and a description of the D-FLAT Debugger. This version features a hard-coded ASP solving module, the possibility of specifying a tree decomposition in the input, and performance improments.

Version 1.0.1

2014-11-16

Version 1.0.1 of D-FLAT is now available for download. Detailed documentation is published in the DBAI Technical Report DBAI-TR-2014-86, including a system overview, example encodings, and a description of the D-FLAT Debugger. Compared to version 1.0.0, this release contains mostly bugfixes.

Version 1.0.0

2014-05-05

Version 1.0.0 of D-FLAT is now available for download. Detailed documentation is published in the DBAI Technical Report DBAI-TR-2014-86, including a system overview, example encodings, and a description of the D-FLAT Debugger.

MSO Encoding

2013-06-21

In recent paper submissions, we presented a D-FLAT encoding for evaluating MSO formulas. Note that the exact syntax of these presented encodings is not yet supported by the released version 0.2 of D-FLAT but will come into effect with the next release. However, with small modifications, MSO can of course also be encoded in D-FLAT 0.2. In fact, we provide such an encoding in the download section.

Version 0.2 released

2013-03-12

Version 0.2 of D-FLAT is now available for download. There, we also provide documentation. If you come from, e.g., the TPLP paper, note that D-FLAT 0.2 (which is not yet featured in a publication but in a master's thesis) is probably not what you want, since encodings for version 0.1, as introduced in the TPLP paper, are not compatible with 0.2 without (small) modifications.

Webpage online

2012-03-26

The D-FLAT webpage is now online and a first version of D-FLAT is provided for download.

Top

Team

People involved in the development of D-FLAT:

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

Top

About

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.

Top

Usage

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 the file instance.lp and edges specified with the predicate edge/2, amounts to this call:

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

Download

We provide different versions of D-FLAT as well as some example dynamic programming specifications and input instances for download.

The current development version of D-FLAT can be found in the D-FLAT repository on Github. From time to time we provide pre-compiled binaries of development versions for download, but be aware that these are not tested and might be broken.

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.0

Version 1.1.0

Version 1.0.1

Version 1.0.0

Version 0.2

Version 0.1

Example instances

We provide a collection of instances of small treewidth for various problems, which was used for preliminary experiments.

Top
Last updated: 2013-06-21 16:24

Home / Kontakt / Webmaster / Offenlegung gemäß § 25 Mediengesetz: Inhaber der Website ist das Institut für Informationssysteme 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.