clasp 3.3.3-3 source package in Ubuntu
Changelog
clasp (3.3.3-3) unstable; urgency=medium * debian/rules: check DEB_BUILD_PROFILES against nocheck -- Thomas Krennwallner <email address hidden> Mon, 05 Feb 2018 20:22:21 +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 | |
|---|---|---|---|---|
| Bionic | release | universe | interpreters |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| clasp_3.3.3-3.dsc | 2.0 KiB | e6a735a0cf25a5096da152734dc5428d480ec40552ef29f504e5fa7aa72e13fe |
| clasp_3.3.3.orig.tar.gz | 802.4 KiB | 952d1dd7a0f79a846e0c09a4edc8a03b9bf2f9e33cb67a2ef371257d438910f3 |
| clasp_3.3.3-3.debian.tar.xz | 7.6 KiB | 55cacbbe63895b802a480cb8f41f4d100a384614db22059bfd66cf7feb4067ff |
Available diffs
- diff from 3.3.3-2 to 3.3.3-3 (599 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
