软件包：clasp（3.3.5-4.2）
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 有关的软件包
|
|
|
|
-
- dep: libatomic1 (>= 4.8)
- 提供 __atomic 内置函数的支持库
-
- dep: libc6 (>= 2.34)
- GNU C 语言运行库：共享库
同时作为一个虚包由这些包填实： libc6-udeb
-
- dep: libgcc-s1 (>= 3.5)
- GCC 支持库
-
- dep: libstdc++6 (>= 12)
- GNU 标准 C++ 库，第3版
-
- rec: gringo
- grounding tools for (disjunctive) logic programs