clasp 3.3.5-4.2 source package in Ubuntu
Changelog
clasp (3.3.5-4.2) unstable; urgency=low * Non-maintainer upload. * Build using the default gcc. (Closes: #1023678) -- Adrian Bunk <email address hidden> Sat, 19 Nov 2022 12:10:37 +0200
Upload details
- Uploaded by:
- Debian Science Team
- Uploaded to:
- Sid
- Original maintainer:
- Debian Science Team
- Architectures:
- any
- Section:
- interpreters
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| clasp_3.3.5-4.2.dsc | 2.0 KiB | 3f7779249406ba72560a20fef48dad036f88691ad2a69d31a8502f6644156080 |
| clasp_3.3.5.orig.tar.gz | 811.6 KiB | c0204b85ea3453af9372d8c7ffcb11306d5279b68c4d4af056f3fad65fe50724 |
| clasp_3.3.5-4.2.debian.tar.xz | 10.1 KiB | 076b8691a0f5dd773d2880632d308b90e98f925ee4bbe347da1eda1fcfc73a45 |
Available diffs
- diff from 3.3.5-4.1 to 3.3.5-4.2 (619 bytes)
No changes file available.
Binary packages built by this source
- clasp: 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).
- clasp-dbgsym: debug symbols for clasp
