Ubuntu
clasp package

clasp 2.1.4-1ubuntu1 source package in Ubuntu

Changelog

clasp (2.1.4-1ubuntu1) trusty; urgency=medium

  * Match the whole line in dpkg-architecture -qDEB_BUILD_ARCH check, to
    avoid getting confused by substrings.
  * Use TBB on ppc64el.
 -- Colin Watson <email address hidden>   Mon, 24 Mar 2014 16:37:20 +0000

Upload details

Uploaded by:
Colin Watson
Uploaded to:
Trusty
Original maintainer:
Ubuntu Developers
Architectures:
any
Section:
interpreters
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Trusty release universe interpreters

Downloads

File Size SHA-256 Checksum
clasp_2.1.4.orig.tar.gz 393.1 KiB 9d4077d64b549903999d8da0689e81855ed4ba488f6c9628c1493788ae73aad5
clasp_2.1.4-1ubuntu1.debian.tar.gz 6.7 KiB f9389924dcfba372006ceda108c855586f844e0221b78f4bd4c713e20fe7be9c
clasp_2.1.4-1ubuntu1.dsc 2.1 KiB 43f9bbb3cd214fef1535062f407f9cf10d50e2d9a42403918fa9e08bae4f52bd

View changes file

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).