Abstract
SAT can be regarded as a problem to decide whether its dual disjunctive form can be simplified to 1. We propose a simple dual algorithm that improves estimates of the degree of the unsatisfiability by orthogonalization. For random satisfiability problems, our algorithm is well behaved with a preconditioning by some parts of the Davis-Putnam procedure.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
