Skip to content
Sections
>> Trisquel >> Packages >> nabia >> interpreters >> clasp
etiona  ] [  nabia  ] [  aramo  ]
[ Source: clasp  ]

Package: clasp (3.3.4-2build1)

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

Other Packages Related to clasp

  • depends
  • recommends
  • suggests
  • dep: libc6 (>= 2.29)
    GNU C Library: Shared libraries
    also a virtual package provided by libc6-udeb
  • dep: libgcc-s1 (>= 3.0) [amd64]
    GCC support library
    dep: libgcc-s1 (>= 3.5) [armhf]
  • dep: libstdc++6 (>= 6)
    GNU Standard C++ Library v3
  • rec: gringo
    grounding tools for (disjunctive) logic programs

Download clasp

Download for all available architectures
Architecture Package Size Installed Size Files
amd64 595.4 kB1723 kB [list of files]
armhf 518.2 kB1158 kB [list of files]