193 search results - page 8 / 39 » sat 2007 |
JSAT
2008
14 years 9 months ago
2008
We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior o...
74
Voted
SAT
2007
Springer
15 years 3 months ago
2007
Springer
In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially ...
CP
2007
Springer
15 years 3 months ago
2007
Springer
As SAT becomes more popular due to its ability to handle large real-world problems, progress in efficiency appears to have slowed down over the past few years. On the other hand, w...
82
Voted
SOFSEM
2007
Springer
15 years 3 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
ICETE
2007
14 years 11 months ago
2007
