Download clasp 3.0.3

An answer set solver for normal or extended logic programs.

Potassco, the Potsdam Answer Set Solving Collection bundles tools for Answer Set Programming developed at the University of Potsdam, among them, the answer set solver clasp, the grounder gringo, and their combinations clingo and iclingo.

clasp is an answer set solver for (extended) normal and disjunctive logic programs. It combines the high-level modeling capacities of answer set programming (ASP) with state-of-the-art techniques from the area of Boolean constraint solving. The primary clasp algorithm relies on conflict-driven nogood learning, a technique that proved very successful for satisfiability checking (SAT). Unlike other learning ASP solvers, clasp does not rely on legacy software, such as a SAT solver or any other existing ASP solver. Rather, clasp has been genuinely developed for answer set solving based on conflict-driven nogood learning. clasp can be applied as an ASP solver (on SMODELS format, as output by Gringo), as a SAT solver (on a simplified version of DIMACS/CNF format), or as a PB solver (on OPB format).


Whats new in version 3.0.3:

• fixed: AsyncResult destructor fails if called after destruction of ClaspFacade
• fixed: projective enumeration sometimes fails when used with option "--restart-on-model"
• fixed: regression in handling of negative lower bound in optimization


Operating system:
Windows 8, Windows 7, Windows Vista, Windows XP, Windows 2000, Windows 98