SAT
2009
Springer
13 years 11 months ago
2009
Springer
State-of-the-art solvers for Quantified Boolean Formulas (QBF) have employed many techniques from the field of Boolean Satisfiability (SAT) including the use of Conjunctive Norm...
SAT
2009
Springer
13 years 11 months ago
2009
Springer
We use the notion of boundary points to study resolution proofs. Given a CNF formula F, a lit(x)-boundary point is a complete assignment falsifying only clauses of F having the sam...
SAT
2009
Springer
13 years 11 months ago
2009
Springer
Induced (chord-free) cycles in binary hypercubes have many applications in computer science. The state of the art for computing such cycles relies on genetic algorithms, which are,...
SAT
2009
Springer
13 years 11 months ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
SAT
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Restart strategies are an important factor in the performance of conflict-driven Davis Putnam style SAT solvers. Selecting a good restart strategy for a problem instance...
SAT
2009
Springer
13 years 11 months ago
2009
Springer
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...