Torsten Schaub
University of Potsdam, Germany
A suite of programs related to ASP, either small utilities or projects still under development. Among them:
AspPlan
AspPlan is an interpreter for a subset of the Planning Domain and Definition Language (PDDL). Since it uses Answer Set Programming (ASP) for the actual search, it can also be seen as a PDDL to ASP compiler. For solving, iClingo from the Potassco tool collection is used.
Bingo
Bingo is an experimental bottom-up grounder based on semi-naive evaluation. Below you find links to the sources and the binary of the latest version. Since bingo is still under development, we do not provide tagged releases yet.
claspre
claspre offers the pre-processing functionalities of clasp in a stand-alone tool.
Coala
Coala is a versatile compiler from action languages to answer set programs. It supports different encodings, variables and LTL style queries
dlvtogringo
dlvtogringo is a tool that converts output generated by “dlv -instantiate” to Gringo’s input language.
PBclasp
PBclasp bundles a set of tools for using the ASP solver clasp as a full-fledged pseudo-Boolean solver. PBclasp works in a three step process:
- first, a problem description formulated in terms of Pseudo-Boolean constraints is mapped into a logic program interpreted under Answer Set semantics
- second, the obtained program is solved with the conflict-driven Answer Set Solver clasp
- finally, resulting answer sets are transformed back to models of the original problem.
Note that PBclasp is no longer developed. Instead, new clasp versions can directly handle instances in OPB format now.
xorro
Inspired by similar approaches in the field of Boolean satisfiability, the tool xorro exploits XOR constraints to calculate samples with near uniform distribution. Hence, it allows for calculating a few answer sets representative for all answer sets of a logic program. This is particularly useful if the computation of all answer sets is practically infeasible.
xpanda
Like Clingcon, xpanda allows for using constraints over finite domain integer variables in logic programs. Unlike with Clingcon, such constraints are expanded, leading to (non-ground) rules that can be grounded by Gringo.