Sciweavers

JSAT
2006
105views more  JSAT 2006»
13 years 11 months ago
The First Evaluation of Pseudo-Boolean Solvers (PB'05)
The first evaluation of pseudo-Boolean solvers was organized as a subtrack of the SAT 2005 competition. The first goal of this event is to take a snapshot of the current state of ...
Vasco M. Manquinho, Olivier Roussel
SAT
2004
Springer
115views Hardware» more  SAT 2004»
14 years 4 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