clasp binary package in Ubuntu Trusty i386
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).
Publishing history
Date | Status | Target | Component | Section | Priority | Phased updates | Version | ||
---|---|---|---|---|---|---|---|---|---|
2014-03-24 17:43:20 UTC | Published | Ubuntu Trusty i386 | release | universe | interpreters | Extra | 2.1.4-1ubuntu1 | ||
|
|||||||||
Deleted | Ubuntu Trusty i386 | proposed | universe | interpreters | Extra | 2.1.4-1ubuntu1 | |||
|
|||||||||
2014-03-24 17:44:10 UTC | Superseded | Ubuntu Trusty i386 | release | universe | interpreters | Extra | 2.1.4-1 | ||
|
|||||||||
2014-03-25 18:10:09 UTC | Deleted | Ubuntu Trusty i386 | proposed | universe | interpreters | Extra | 2.1.4-1 | ||
|
|||||||||
2013-12-14 11:54:06 UTC | Superseded | Ubuntu Trusty i386 | release | universe | interpreters | Extra | 2.1.3-1 | ||
|