Sciweavers

19 search results - page 1 / 4
» jsat 2006
Sort
View
JSAT
2008
90views more  JSAT 2008»
13 years 4 months ago
2006 and 2007 Max-SAT Evaluations: Contributed Instances
In this technical report we briefly describe the instances submitted to the 2006 and 2007 MaxSAT Evaluations. First, we introduce the instances that can be directly encoded as Max...
Federico Heras, Javier Larrosa, Simon de Givry, Th...
JSAT
2006
93views more  JSAT 2006»
13 years 4 months ago
Back to the SAT05 Competition: an a Posteriori Analysis of Solver Performance on Industrial Benchmarks
This paper analyzes the SAT05 solver competition on industrial instances. We carefully investigate the performance of solvers from the competition and demonstration categories. We...
Emmanuel Zarpas
JSAT
2006
68views more  JSAT 2006»
13 years 4 months ago
Locality and Hard SAT-Instances
In this note we construct a family of SAT-instance based on Eulerian graphs which are aimed at being hard for resolution based SAT-solvers. We discuss some experiments made with i...
Klas Markström
JSAT
2006
105views more  JSAT 2006»
13 years 4 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
JSAT
2006
119views more  JSAT 2006»
13 years 4 months ago
A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. This algorithm uses the clauseshorte...
Evgeny Dantsin, Alexander Wolpert