We have moved!Our new web portal is at potassco.org.
aclasp uses a slightly modified restart policy based upon the average decision level on which conflicts occurred in the last restart interval.
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.
claspar is a parallelized version of clasp 1 using MPI to distribute search.
claspD is an extension of clasp that allows for solving disjunctive logic programs.
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.
hclasp provides a general declarative framework to incorporate domain-specific heuristics into ASP solving. It extends clasp allowing to program the heuristic of the solver directly from the ASP code.
iClingo is an incremental ASP system implemented on top of Clingo 3. It is based on the idea that the grounder as well as the solver are implemented in a stateful way. Thus, both keep their previous states while increasing an incremental parameter. As regards grounding, at each incremental step, the goal is to produce only ground rules stemming from the current program slice, without re-producing previous ground rules. The ground program slices are then gradually passed to the solver that accumulates ground rules and computes answer sets for them.
oClingo is a system for reactive answer set programming, extending gringo and clasp for handling external data streams provided at runtime via a controller.
PBclasp bundles a set of tools for using the ASP solver clasp as a full-fledged pseudo-Boolean solver.
clasp-1.3.X extended with option --opt-uncore that enables unsatisfiability-based optimization as in MSUnCore.