Paketti: clasp (3.3.5-4.2)

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

Tagit: Implemented in: C++, Role: Program

Muut pakettiin clasp liittyvät paketit

• dep: libatomic1 (>= 4.8)

  support library providing __atomic built-in functions

• dep: libc6 (>= 2.34)

  GNU-C-kirjasto: jaetut kirjastot
  myös näennäispaketti, jonka toteuttaa libc6-udeb

• dep: libgcc-s1 (>= 3.5)

  GCC:n apukirjasto

• dep: libstdc++6 (>= 12)

  GNU standardi C++ -kirjasto, versio 3

• rec: gringo

  grounding tools for (disjunctive) logic programs

Imuroi clasp

Imurointi kaikille saataville arkkitehtuureille

Arkkitehtuuri	Paketin koko	Koko asennettuna	Tiedostot
armel	515.9 kt	1,506.0 kt	[tiedostoluettelo]