Fifty-Five Solvers in Vancouver: The SAT 2004 Competition.
Daniel Le BerreLaurent SimonPublished in: SAT (Selected Papers (2004)
Keyphrases
- sat solvers
- sat solving
- sat instances
- modulo theories
- boolean satisfiability
- propositional satisfiability
- orders of magnitude
- backtracking search
- sat problem
- sat encodings
- max sat
- satisfiability problem
- search space
- search tree
- constraint satisfaction
- maximum satisfiability
- clause learning
- years ago
- quantified boolean formulas
- randomly generated
- constraint satisfaction problems
- international competition
- symmetry breaking
- search strategies
- branch and bound algorithm
- satisfiability modulo theories
- solving hard
- answer set programming
- combinatorial problems