Sciweavers

8 search results - page 1 / 2
» Fifty-Five Solvers in Vancouver: The SAT 2004 Competition
Sort
View
SAT
2004
Springer
95views Hardware» more  SAT 2004»
13 years 10 months ago
Fifty-Five Solvers in Vancouver: The SAT 2004 Competition
Abstract. For the third consecutive year, a SAT competition was organized as a joint event with the SAT conference. With 55 solvers from 25 author groups, the competition was a cle...
Daniel Le Berre, Laurent Simon
SAT
2004
Springer
109views Hardware» more  SAT 2004»
13 years 10 months ago
Resolve and Expand
We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). The basic idea is to resolve existentially quantifie...
Armin Biere
SAT
2004
Springer
115views Hardware» more  SAT 2004»
13 years 10 months ago
Full CNF Encoding: The Counting Constraints Case
Abstract. Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding...
Olivier Bailleux, Yacine Boufkhad
SAT
2004
Springer
94views Hardware» more  SAT 2004»
13 years 10 months ago
QBF Reasoning on Real-World Instances
Abstract. During the recent years, the development of tools for deciding Quantified Boolean Formulas (QBFs) has been accompanied by a steady supply of real-world instances, i.e., ...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...
CSCLP
2004
Springer
13 years 10 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov