Sciweavers

JSAT
2006
108views more  JSAT 2006»
13 years 9 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 9 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
2006
92views more  JSAT 2006»
13 years 9 months ago
A Translation of Pseudo Boolean Constraints to SAT
This paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows unit propagation to maintain generalized arc consistency. In the worst case, the size of the p...
Olivier Bailleux, Yacine Boufkhad, Olivier Roussel
JSAT
2006
87views more  JSAT 2006»
13 years 9 months ago
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
Harri Haanpää, Matti Järvisalo, Pet...
JSAT
2006
93views more  JSAT 2006»
13 years 9 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
134views more  JSAT 2006»
13 years 9 months ago
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
Hossein M. Sheini, Karem A. Sakallah
JSAT
2006
88views more  JSAT 2006»
13 years 9 months ago
On Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
Vasco M. Manquinho, João P. Marques Silva
JSAT
2006
69views more  JSAT 2006»
13 years 9 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
68views more  JSAT 2006»
13 years 9 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 9 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