117
click to vote
SAT
15 years 7 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...
121
Voted
SAT
15 years 7 months ago
2009 Springer 
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
111
click to vote
SAT
15 years 7 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...
122
Voted
SAT
15 years 7 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 ...
110
click to vote
SAT
15 years 7 months ago
2009 Springer
We introduce Cardinality Networks, a new CNF encoding of cardinality constraints. It improves upon the previously existing encodings such as the sorting networks of [ES06] in that ...
|
Hardware