clasp
| swMATH ID: | 7095 |
| Software Authors: | Gebser, Martin; Kaufmann, Benjamin; Neumann, André; Schaub, Torsten |
| Description: | clasp: A conflict-driven answer set solver. clasp is part of the Potassco project hosted at SourceForge. Source code and pre-compiled binaries are available on the Potassco download page. clasp is an answer set solver for (extended) normal 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). |
| Homepage: | http://www.cs.uni-potsdam.de/clasp/ |
| Keywords: | Potassco; answer set solver; ASP |
| Related Software: | Gringo; Clingo; WASP; ASSAT; MiniSat; iClingo; Smodels; Potassco; Cmodels; Clingcon; SATzilla; Lparse; DLV2; DLV; GASP; Lingeling; Chaff; GitHub; MiniZinc; IDP3 |
| Cited in: | 108 Documents |
all
top 5
Cited by 220 Authors
all
top 5
Cited in 16 Serials
all
top 5
