clasp 3.3.5-4.2build1 source package in Ubuntu
Changelog
clasp (3.3.5-4.2build1) devel; urgency=medium * No-change rebuild to fix FTBFS via lto-disabled-list (LP: #2017091) -- Lukas Märdian <email address hidden> Thu, 20 Apr 2023 09:30:46 +0200
Upload details
- Uploaded by:
- Lukas Märdian
- Uploaded to:
- Lunar
- Original maintainer:
- Debian Science Team
- Architectures:
- any
- Section:
- interpreters
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Mantic | release | universe | interpreters |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
clasp_3.3.5.orig.tar.gz | 811.6 KiB | c0204b85ea3453af9372d8c7ffcb11306d5279b68c4d4af056f3fad65fe50724 |
clasp_3.3.5-4.2build1.debian.tar.xz | 10.2 KiB | a689b370ff23783c7404a7913672f69f0e7bd7bc77473f449cde43e1d90cb35f |
clasp_3.3.5-4.2build1.dsc | 2.0 KiB | 01ce54480bf589661c5584946fd3411bbc0f7d4479d8ec9431d1088986c651e9 |
Available diffs
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