clasp 3.3.3-1 source package in Ubuntu
Changelog
clasp (3.3.3-1) unstable; urgency=medium * New upstream version 3.3.3 * debian/watch: download from /releases/download/vN.N.N * drop upstream applied clasp-remove-wrong-assertion.patch -- Thomas Krennwallner <email address hidden> Sun, 12 Nov 2017 09:11:47 +0100
Upload details
- Uploaded by:
- Debian Science Team
- Uploaded to:
- Sid
- Original maintainer:
- Debian Science Team
- Architectures:
- any
- Section:
- interpreters
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
clasp_3.3.3-1.dsc | 2.0 KiB | 297b061a6e5cee92871b4fae7e26097a82f233056b7cee56056b709c43460234 |
clasp_3.3.3.orig.tar.gz | 802.4 KiB | 952d1dd7a0f79a846e0c09a4edc8a03b9bf2f9e33cb67a2ef371257d438910f3 |
clasp_3.3.3-1.debian.tar.xz | 7.5 KiB | b9fb8caf4e7c387ec462b8d34d8e73932ac0cbf3a472a6983229d28bcb99373f |
Available diffs
- diff from 3.3.2-2 to 3.3.3-1 (6.3 KiB)
- diff from 3.3.2-4 to 3.3.3-1 (6.0 KiB)
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