Release 1.2.5

This release contains the following notable changes:

• Lazy evaluation now supports built-in counter arithmetic.

An earlier version of the system is documented in our Technical Report DBAI-TR-2014-86, Technische Universität Wien, 2014, http://dbai.tuwien.ac.at/research/report/dbai-tr-2014-86.pdf

Release 1.2.4

This release contains the following notable changes:

• Added support for the htd library's generation of tree decompositions based on various fitness criteria.

An earlier version of the system is documented in our Technical Report DBAI-TR-2014-86, Technische Universität Wien, 2014, http://dbai.tuwien.ac.at/research/report/dbai-tr-2014-86.pdf

Release 1.2.3

This release contains the following notable changes:

• Updated dependency on htd library to its version 1.0.1
• Fixed assertion that failed on very slow machines

An earlier version of the system is documented in our Technical Report DBAI-TR-2014-86, Technische Universität Wien, 2014, http://dbai.tuwien.ac.at/research/report/dbai-tr-2014-86.pdf

Release 1.2.2

This release contains the following notable changes:

• Updated dependency on htd library due to a bug in older versions of htd.
• Fixed error when newline in ASP encoding is CR or CR-LF (e.g., on Windows systems).

An earlier version of the system is documented in our Technical Report DBAI-TR-2014-86, Technische Universität Wien, 2014, http://dbai.tuwien.ac.at/research/report/dbai-tr-2014-86.pdf

Release 1.2.1

This release contains the following notable changes:

• Fixed bug that caused costs to always be 0 when using the --cardinality-cost option.
• Fixed parse errors when newline is CR or CR-LF (e.g., on Windows systems).
• Updated to newer htd version.

An earlier version of the system is documented in our Technical Report DBAI-TR-2014-86, Technische Universität Wien, 2014, http://dbai.tuwien.ac.at/research/report/dbai-tr-2014-86.pdf

Release 1.2.0

This release contains the following notable changes:

• Added --lazy option to the clasp solving module to perform "lazy" dynamic programming. This feature is described in detail in [1]. It computes rows one-by-one only if they are needed, and solutions are printed as soon as they are found. This can improve performance if one is interested in only one solution. It can also help for making optimization problems more efficient. It also makes anytime algorithms possible, which can be useful for optimization problems if running times are too long and suboptimal solutions are acceptable.
• Added possibility to use so-called counters in item tree nodes. This allows the user to keep arithmetic away from ASP and have it done within D-FLAT.
• Added option to use cardinality of item sets as costs (i.e., without having to count in ASP).
• Using the htd library instead of htdecomp (which was part of the SHARP framework).
• Added --stats option for printing clasp solving statistics.
• Updated to latest gringo and clasp versions.

The system is documented in our Technical Report DBAI-TR-2014-86, Technische Universität Wien, 2014, http://dbai.tuwien.ac.at/research/report/dbai-tr-2014-86.pdf

[1] Bernhard Bliem, Benjamin Kaufmann, Torsten Schaub and Stefan Woltran: ASP for Anytime Dynamic Programming on Tree Decompositions. IJCAI 2016. To appear.

Release 1.1.0

This release contains the following notable changes:

• Added a solver module for solving propositional disjunctive ASP via hard-coded C++ code.
• Added an instance generator for randomly generating propositional disjunctive ASP programs.
• Tree decompositions can now be specified by the user in a (rudimentary) GraphML format.
• Improved time and memory efficiency, among other things by using flyweight strings.
• Updated to Gringo 4.5.0 and Clasp 3.1.2, which handle certain constructions (like the ";" separator for pooling) differently than before and might require revising existing D-FLAT encodings.

The system is documented in our Technical Report DBAI-TR-2014-86, Technische Universität Wien, 2014, http://dbai.tuwien.ac.at/research/report/dbai-tr-2014-86.pdf

Release 1.0.1

This release mostly fixes bugs. The system is documented in our Technical Report DBAI-TR-2014-86, Technische Universität Wien, 2014, http://dbai.tuwien.ac.at/research/report/dbai-tr-2014-86.pdf

Release 1.0.0

This release is documented in our Technical Report DBAI-TR-2014-86, Technische Universität Wien, 2014, http://dbai.tuwien.ac.at/research/report/dbai-tr-2014-86.pdf