Skip to content

Release 1.2.0
Compare
Choose a tag to compare
@bbliem bbliem released this 02 Jun 15:12
· 19 commits to master since this release
v1.2.0
2f9ea75

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.

Assets 3