Sciweavers

19 search results - page 3 / 4
» jsat 2006
Sort
View
JSAT
2006
69views more  JSAT 2006»
13 years 5 months ago
The SAT 2005 Solver Competition on Random Instances
An analysis of the SAT 2005 sub-competition on random instances is given. This year this (sub-)competition set-up was geared to establish a basic setting, focusing on the instance...
Oliver Kullmann
JSAT
2006
83views more  JSAT 2006»
13 years 5 months ago
Report of the Third QBF Solvers Evaluation
This paper reports about the 2005 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the third in a series of non-competitive events established with the ai...
Massimo Narizzano, Luca Pulina, Armando Tacchella
JSAT
2006
108views more  JSAT 2006»
13 years 5 months ago
Translating Pseudo-Boolean Constraints into SAT
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
Niklas Eén, Niklas Sörensson
JSAT
2006
109views more  JSAT 2006»
13 years 5 months ago
Decomposing SAT Problems into Connected Components
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This o...
Armin Biere, Carsten Sinz
JSAT
2008
83views more  JSAT 2008»
13 years 5 months ago
The First and Second Max-SAT Evaluations
We describe the organization and report on the results of the First and Second Max-SAT Evaluations, which were organized as affiliated events of the 2006 and 2007 editions of the ...
Josep Argelich, Chu Min Li, Felip Manyà, Jo...