clasp 3.3.5-4ubuntu1 source package in Ubuntu


clasp (3.3.5-4ubuntu1) jammy; urgency=medium

  * d/p/use-system-catch-for-glibc-2.34-compat.patch: Fix FTBFS with glibc-2.34
    - Add catch v1 build-dependency
    - Make use of system provided catch v1 (CTest) library

 -- Lukas Märdian <email address hidden>  Wed, 19 Jan 2022 14:36:04 +0100

Upload details

Uploaded by:
Lukas Märdian
Uploaded to:
Original maintainer:
Ubuntu Developers
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Kinetic release universe interpreters
Jammy release universe interpreters


File Size SHA-256 Checksum
clasp_3.3.5.orig.tar.gz 811.6 KiB c0204b85ea3453af9372d8c7ffcb11306d5279b68c4d4af056f3fad65fe50724
clasp_3.3.5-4ubuntu1.debian.tar.xz 10.2 KiB 91fe0fa495b683c1706a6877003b8aba9fd69d65e6a5dc8920636cfe52310271
clasp_3.3.5-4ubuntu1.dsc 2.1 KiB f4d0bfbd1a75afbc2544619a49e06e772762fbcf075b0af9c1c97661c05e1942

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

clasp-dbgsym: debug symbols for clasp