-
Notifications
You must be signed in to change notification settings - Fork 16
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
The strength of clasp on normal logic program #109
Comments
However, it currently lacks certain inprocessing techniques and heuristics that are e.g. implemented in Typically, performance on particular problems can be improved by adjusting some of the many provided options (see |
May I also ask if clasp has adapted any QBF-solving techniques for those sigma-2-p complete disjunctive programs? If yes, what are the referenced QBF solvers? |
No, |
I'm trying to use clasp to solve some normal logic programs and it seems like clasp (clingo version 5.7.1) is (much) slower than converting the normal logic program to SAT and solving it with kissat in most UNSAT instances. If I'm not wrong, clasp is using a stable model version of the CDCL algorithm, so my question is which CDCL SAT solver is similar to clasp in terms of solving techniques? In other words, the SAT solver has certain techniques on CNF and clasp has adapted the corresponding technique to normal logic programs. Chaff/Zchaff/Minisat/Cadical?
The text was updated successfully, but these errors were encountered: