A constraint-based approach to narrow search trees for satisfiability

• 30 July 1999
• journal article
• research article
• Published by Elsevier in Information Processing Letters
• Vol. 71  (2) , 75-80
• https://doi.org/10.1016/s0020-0190(99)00088-5

Abstract

Keywords

• COMPUTATIONAL COMPLEXITY
• AUTOMATIC THEOREM PROVING
• DP PROCEDURE
• SAT