3 search results - page 1 / 1 » Report of the Third QBF Solvers Evaluation |
87
Voted
JSAT
2006
14 years 9 months ago
2006
This paper reports about the 2005 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the third in a series of non-competitive events established with the ai...
75
Voted
SAT
2004
Springer
15 years 2 months ago
2004
Springer
This paper reports about the 2004 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the second in a series of non-competitive events established with the a...
145
Voted
SAT
2011
Springer
14 years 10 days ago
2011
Springer
Failed literal detection (FL) in SAT is a powerful approach for preprocessing. The basic idea is to assign a variable as assumption. If boolean constraint propagation (BCP) yields ...