The succinct solver is a tool for solving constrains specified by the Alternation-free Least Fixed Point Logic (ALFP) in clausal form, which is an extension of Horn Clause. Technologies group with the group of Helmut Seidl at the Technical University of München, Germany.
The Succinct Solver has been evolved from the earlier version (V1.0), which is based on the bounded finite universe that can be pre-computed directly from the clause of interest, to the extended version (V2.0), which considers an unbounded universe that is dynamically expanded with the solving process.
Both versions and additional material can be downloaded from the download page. For more information, please refer to the companion publications.