aclasp
aclasp uses a slightly modified restart policy based upon the average decision level on which conflicts occurred in the last restart interval.
Download Documentation Support
aspeed
aspeed offers scripts to compute timeout minimal time slices and the corresponding time minimal solver ordering to optimize the robustness of solvers.
aspcud
aspcud is a solver for CUDF instances based on ASP tools developed within the potassco project.
aspuncud
Solver for upgrade scenarios in the Common Upgradeability Description Format (CUDF). Winner of Paranoid and Trendy Track at the Mancoosi International Solver Competition (MISC) 2011.
bingo
Note: Bingo became gringo version 3.x.
claspre
claspre offers the pre-processing functionalities of clasp
in a stand-alone tool.
Note:
claspre is no longer developed.
Starting with clasp-1.3.4, clasp can be built with additional claspre functionality.
For more information consult clasp's README.
Download Documentation Resources Support
dlvtogringo
dlvtogringo is a tool that converts output generated by "dlv -instantiate" to Gringo's input language.
fimo
fimo is a system for computing finite models of first-order theories
(written in TPTP format)
via incremental Answer Set Programming.
fimo uses iClingo for finding answer sets of the resulting logic program.
An answer set represents a finite model of the input theory.
August, 2011:
fimo won the best newcomer award in CASC-23.
It came in second in the FNT (First-order Non-Theorems) division.
fmc2iasp
fmc2iasp is a system for computing finite models of first-order theories
(written in TPTP format)
via incremental Answer Set Programming.
fmc2iasp uses iClingo for finding answer sets of the resulting logic program.
An answer set represents a finite model of the input theory.
Note:
fimo is the successor of fmc2iasp.
Download Support Article Citation
inca
The prototypical preprocessor Inca allows for using variables and constraints over finite domains in logic programs. It offers various options leading to (non-ground) enodings that can be grounded by Gringo.
Download Benchmarks Support Article Citation
lp2txt
A simple script that transforms ground lparse output format back into a readable format.
metasp
The metasp project comprises a set of encodings that allow for handling complex optimization criteria, e.g., inclusion-based minimization or Pareto efficiency. For solving, the potassco tools gringo and claspD are used.
Download and Resources Support Article Citation
oclingo
Oclingo is a system for reactive answer set programming, extending gringo and clasp for handling external data streams provided at runtime via a controller.
Download and Resources Support Article Citation
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: PBclasp is no longer developed. Instead, new clasp versions can directly handle instances in OPB format now.
plasp
Plasp is an interpreter for a subset of the Planning Domain 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, a modified version of iClingo from the Potassco tool collection is used.
Download Linux Binary Support Article Citation
pyngo
Pyngo is a bottom-up ASP grounder written in Python with the goal to provide a well-documented grounder exploring bottom-up grounding and related techniques.
sbass
The preprocessor Sbass detects and breaks symmetries in the search space of ASP instances by adding symmetry-breaking constraints.
Download Support Article Citation
unclasp
clasp-1.3.X extended with option --opt-uncore that enables unsatisfiability-based optimization as in MSUnCore.
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.
Download Documentation Support
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.
Download Documentation Support Article Citation
misc
A collection of miscellaneous helper scripts and files.
Zsh auto-completion for potassco
Gringo syntax highlighting for vim
Support
