A conflict-driven nogood learning answer set solver for disjunctive logic programs.


claspD is an extension of clasp that allows for solving disjunctive logic programs expressing Sigma_2^P-hard problems. It uses a new approach to disjunctive ASP solving that aims at an equitable interplay between "generating" and "testing" solver units. The solver units are launched only once with their respective Boolean constraint problems and subsequently communicate in a bidirectional way, enabling both generators and testers to benefit from conflict-driven learning over whole runs.

claspD is part of the Potassco project hosted at SourceForge.





A User's Guide is available from our Potassco project site. Source code documentation can be found in the /doc directory of each source code release. You will need Doxygen to build the documentation.