clasp (math/clasp) Updated: 2 months ago Add to my watchlist
A conflict-driven nogood learning answer set solverclasp 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 GitHubStatistics for selected duration
2024-Mar-19 to 2024-Apr-18
Total Installations | 1 |
---|---|
Requested Installations | 1 |
Loading Chart
Loading Chart
Loading Chart
Loading Chart
Variants | Count |
---|
Monthly Statistics
Can remain cached for up to 24 hours
Loading Chart
Percentage of installations per version per month
Loading Chart