Sound and complete algorithms for boolean satifiability To my best knowledge, these are the sound and complete algorithms for boolean satisfiability


Variations of DPLL algorithm (e.g. CDCL, Look-ahead solvers)
Stalmarks method
Binary Decision Diagram (BDD)


I am looking for other sound and complete algorithms for boolean satisfiability?
Resolution is sound and complete. In recursive learning, you recursively evaluate the clause satisfiability requirements for identifying common assignments. Look at say page 29 and onwards in these slides.