clasp 3.2.2-1 source package in Ubuntu

Changelog

clasp (3.2.2-1) unstable; urgency=medium

  * New upstream version 3.2.2
  * drop clasp-alpha-fpu-getcw.patch, already applied upstream

 -- Thomas Krennwallner <email address hidden>  Wed, 01 Feb 2017 11:52:16 +0100

Upload details

Uploaded by:
Debian Science Team on 2017-02-01
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
Zesty proposed on 2017-02-01 universe interpreters

Downloads

File Size SHA-256 Checksum
clasp_3.2.2-1.dsc 2.0 KiB b7f650d7d4bfde01172bb012898b83637c7d4c1dd05a6f5a51b3d1f1b9441207
clasp_3.2.2.orig.tar.gz 701.9 KiB 9e16795dd8c87cda76eb42413f2828c6a234869c9299c85806b38599284f86f4
clasp_3.2.2-1.debian.tar.xz 7.3 KiB 8cb7349376db4e565cff15f85ccad51298276d1877d046af53bb40e954988da9

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: debug symbols for package clasp

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