Ubuntu
clasp package

clasp 3.3.2-2 source package in Ubuntu

Changelog

clasp (3.3.2-2) unstable; urgency=medium

  * Bug fix: "clasp FTBFS on armel: undefined reference to
    `__atomic_load_8'", thanks to Adrian Bunk (Closes: #872549).
  * debian/rules: link with libatomic on armel

 -- Thomas Krennwallner <email address hidden>  Mon, 21 Aug 2017 08:31:52 +0200

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 Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
clasp_3.3.2-2.dsc 2.0 KiB 91eea2a8ee088b03fa3e66b29a9ef3bfc8d3da08c48eca3aa9e14a7042c3a279
clasp_3.3.2.orig.tar.gz 801.1 KiB 367f9f3f035308bd32d5177391a470d9805efc85a737c4f4d6d7b23ea241dfdf
clasp_3.3.2-2.debian.tar.xz 7.1 KiB 3b92b275e344e6c59d5b8f7e9bb2b05e65d1dcf6d7d9ab5677def996c42159d2

Available diffs

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: No summary available for clasp-dbgsym in ubuntu artful.

No description available for clasp-dbgsym in ubuntu artful.