clasp binary package in Ubuntu Bionic ppc64el
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 | ||
---|---|---|---|---|---|---|---|---|---|
2018-02-07 08:40:00 UTC | Published | Ubuntu Bionic ppc64el | release | universe | interpreters | Extra | 3.3.3-3 | ||
|
|||||||||
Deleted | Ubuntu Bionic ppc64el | proposed | universe | interpreters | Extra | 3.3.3-3 | |||
|
|||||||||
2018-02-07 08:40:10 UTC | Superseded | Ubuntu Bionic ppc64el | release | universe | interpreters | Extra | 3.3.3-2 | ||
|
|||||||||
2018-02-08 12:10:09 UTC | Deleted | Ubuntu Bionic ppc64el | proposed | universe | interpreters | Extra | 3.3.3-2 | ||
|
|||||||||
2018-02-04 01:14:12 UTC | Superseded | Ubuntu Bionic ppc64el | release | universe | interpreters | Extra | 3.3.3-1 | ||
|
|||||||||
2018-02-05 06:10:09 UTC | Deleted | Ubuntu Bionic ppc64el | proposed | universe | interpreters | Extra | 3.3.3-1 | ||
|
|||||||||
2017-11-12 20:19:00 UTC | Superseded | Ubuntu Bionic ppc64el | release | universe | interpreters | Extra | 3.3.2-2 | ||
|