A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is
Solving Difficult SAT Instances Using Greedy Clique Decomposition
Lecture Notes in Computer Science
We are dealing with solving difficult SAT instances in this paper. We propose a method for preprocessing SAT instances (CNF formulas) by using consistency techniques known from constraint programming methodology and by using our own consistency technique based on clique decomposition of a graph representing conflicts in the input formula. The clique decomposition allows us to make a strong reasoning over the SAT instance, which even in some cases decides the SAT instance itself without search.doi:10.1007/978-3-540-73580-9_28 dblp:conf/sara/Surynek07 fatcat:uoutwwgctbbdvc6iafu5dm3yqa