121 search results - page 1 / 25 » Adaptive Application of SAT Solving Techniques |
ENTCS
2006
13 years 4 months ago
2006
New heuristics and strategies have enabled major advancements in SAT solving in recent years. However, experimentation has shown that there is no winning solution that works in al...
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 ...
JSAT
2008
13 years 4 months ago
2008
We describe the organization and report on the results of the First and Second Max-SAT Evaluations, which were organized as affiliated events of the 2006 and 2007 editions of the ...
SAT
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Preprocessing has proven important in enabling efficient Boolean satisfiability (SAT) solving. For many real application scenarios of SAT it is important to be able to ...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...