Source: clasp Section: interpreters Priority: optional Maintainer: Debian Science Maintainers Uploaders: Thomas Krennwallner Build-Depends: debhelper (>= 11), dpkg-dev (>= 1.16.1~), g++-8 (>= 8.2.0), cmake (>= 3.1.0) Standards-Version: 4.2.1 Vcs-Git: https://salsa.debian.org/science-team/clasp.git Vcs-Browser: https://salsa.debian.org/science-team/clasp Homepage: https://www.potassco.org/clasp/ Package: clasp Architecture: any Depends: ${shlibs:Depends}, ${misc:Depends} Recommends: gringo Description: conflict-driven nogood learning answer set solver 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 LPARSE output format), as a SAT solver (on simplified DIMACS/CNF format), or as a PB solver (on OPB format).