clasp (math/clasp) Updated: 5 months ago Add to my watchlist

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

Version: 3.3.10 License: MIT GitHub
Displaying statistics for 1,036 users who made submissions during: until

Statistics for selected duration

2024-Jun-22 to 2024-Jul-22


No stats available for this selection.

Try changing the range of days. Alternatively visit statistics page to have an overall look at the submitted statistics.