openQbf
| Submitter: | Daniel Le Berre | ||
| Description: | Devised by Gilles Audemard, Daniel Le Berre and Olivier Roussel, it is a search-based solver, featuring basic unit propagation and pure literal lookahead, plus a conflict backjumping lookback engine. The heuristic is derived from Bohm and Speckenmeyer's heuristic for SAT. | ||
| Results: | |||