610 search results - page 11 / 122 » Using SAT in QBF |
SAT
2009
Springer
14 years 2 months ago
2009
Springer
Most current propositional SAT solvers apply resolution at various stages to derive new clauses or simplify existing ones. The former happens during conflict analysis, while the l...
JSAT
2006
13 years 7 months ago
2006
An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due t...
CORR
2008
Springer
13 years 7 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...
SAT
2010
Springer
13 years 11 months ago
2010
Springer
Assignment stack shrinking is a technique that is intended to speed up the performance of modern complete SAT solvers. Shrinking was shown to be efficient in SAT’04 competition w...
AE
2007
Springer
14 years 1 months ago
2007
Springer
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific su...