Volume 2 Contents

Special Volume on the SAT 2005 competitions and evaluations
Editors: Daniel Le Berre and Laurent Simon

Download all articles from this volume


Daniel Le Berre and Laurent Simon. Preface.

Articles


Niklas Eén and Niklas Sörensson. Translating Pseudo-Boolean Constraints into SAT. Volume 2 (2006), pages 1-26.
  • Keywords: pseudo-Boolean, SAT-solver, SAT translation, integer linear programming.
  • PDF

Harri Haanpää, Matti Järvisalo, Petteri Kaski, and Ilkka Niemelä. Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques. Volume 2 (2006), pages 27-46.
  • Keywords: benchmarking, Boolean satisfiability, equivalence reasoning, satisfiable instances.
  • PDF

Marijn J. H. Heule and Hans van Maaren. March_dl: Adding Adaptive Heuristics and a New Branching Strategy. Volume 2 (2006), pages 47-59.
  • Keywords: adaptive heuristics, look-ahead, SAT solving, SAT competition.
  • PDF

Oliver Kullmann. The SAT 2005 Solver Competition on Random Instances. Volume 2 (2006), pages 61-102.
  • Keywords: random satisfiability problems, phase transition, threshold behaviour, critical exponent, SAT competition.
  • PDF

Vasco M. Manquinho and Olivier Roussel. The First Evaluation of Pseudo-Boolean Solvers (PB'05). Volume 2 (2006), pages 103-143.
  • Keywords: pseudo-Boolean, evaluation, benchmarks.
  • PDF

Massimo Narizzano, Luca Pulina, and Armando Tacchella. Report of the Third QBF Solvers Evaluation. Volume 2 (2006), pages 145-164.
  • Keywords: quantied Boolean formulas, empirical evaluation, automated reasoning tools.
  • PDF

Hossein M. Sheini and Karem A. Sakallah. Pueblo: A Hybrid Pseudo-Boolean SAT Solver. Volume 2 (2006), pages 165-189.
  • Keywords: satisfiability, SAT solver, pseudo-Boolean, inference-based learning.
  • PDF

Research Notes


Olivier Bailleux, Yacine Boufkhad, and Olivier Roussel. A Translation of Pseudo Boolean Constraints to SAT. Volume 2 (2006), research note, pages 191-200.
  • Keywords: pseudo-Boolean, SAT translation.
  • PDF

Armin Biere and Carsten Sinz. Decomposing SAT Problems into Connected Components. Volume 2 (2006), research note, pages 201-208.
  • Keywords: SAT, connected components.
  • PDF

Vasco M. Manquinho and João Marques-Silva. On Using Cutting Planes in Pseudo-Boolean Optimization. Volume 2 (2006), research note, pages 209-219.
  • Keywords: pseudo-Boolean optimization, cutting planes, search restarts.
  • PDF

Klas Markström. Locality and Hard SAT-Instances. Volume 2 (2006), research note, pages 221-227.
  • Keywords: satisfiability, hard instances, resolution, graphs, density.
  • PDF

Emmanuel Zarpas. Back to the SAT05 Competition: an a Posteriori Analysis of Solver Performance on Industrial Benchmarks. Volume 2 (2006), research note, pages 229-237.
  • Keywords: satisfiability, benchmarking, performances, metrics, industrial problems.
  • PDF