Skip to content
Sections
>> Trisquel >> Paket >> etiona >> interpreters >> clasp
etiona  ] [  nabia  ] [  aramo  ]
[ Källkod: clasp  ]

Paket: clasp (3.3.3-3)

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

Andra paket besläktade med clasp

  • beror
  • rekommenderar
  • föreslår
  • dep: libc6 (>= 2.14) [amd64]
    GNU C Library: Shared libraries
    också ett virtuellt paket som tillhandahålls av libc6-udeb
    dep: libc6 (>= 2.4) [i386]
  • dep: libgcc1 (>= 1:3.0) [amd64]
    GCC support library
    dep: libgcc1 (>= 1:4.2) [i386]
  • dep: libstdc++6 (>= 6)
    GNU Standard C++ Library v3
  • rec: gringo
    grounding tools for (disjunctive) logic programs

Hämta clasp

Hämtningar för alla tillgängliga arkitekturer
Arkitektur Paketstorlek Installerad storlek Filer
amd64 606,7 kbyte1743 kbyte [filförteckning]
i386 663,9 kbyte1854 kbyte [filförteckning]