Volume 2,
Number 1-4,
March 2006
Special Volume on the SAT 2005 competitions,
evaluations
- Daniel Le Berre, Laurent Simon:
Preface.
Electronic Edition (link) BibTeX
- Niklas Eén, Niklas Sörensson:
Translating Pseudo-Boolean Constraints into SAT.
1-26
Electronic Edition (link) BibTeX
- Harri Haanpää, Matti Järvisalo, Petteri Kaski, Ilkka Niemelä:
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques.
27-46
Electronic Edition (link) BibTeX
- Marijn Heule, Hans van Maaren:
March_dl: Adding Adaptive Heuristics and a New Branching Strategy.
47-59
Electronic Edition (link) BibTeX
- Oliver Kullmann:
The SAT 2005 Solver Competition on Random Instances.
61-102
Electronic Edition (link) BibTeX
- Vasco M. Manquinho, Olivier Roussel:
The First Evaluation of Pseudo-Boolean Solvers (PB'05).
103-143
Electronic Edition (link) BibTeX
- Massimo Narizzano, Luca Pulina, Armando Tacchella:
Report of the Third QBF Solvers Evaluation.
145-164
Electronic Edition (link) BibTeX
- Hossein M. Sheini, Karem A. Sakallah:
Pueblo: A Hybrid Pseudo-Boolean SAT Solver.
165-189
Electronic Edition (link) BibTeX
- Olivier Bailleux, Yacine Boufkhad, Olivier Roussel:
A Translation of Pseudo Boolean Constraints to SAT.
191-200
Electronic Edition (link) BibTeX
- Armin Biere, Carsten Sinz:
Decomposing SAT Problems into Connected Components.
201-208
Electronic Edition (link) BibTeX
- Vasco M. Manquinho, João P. Marques Silva:
On Using Cutting Planes in Pseudo-Boolean Optimization.
209-219
Electronic Edition (link) BibTeX
- Klas Markström:
Locality and Hard SAT-Instances.
221-227
Electronic Edition (link) BibTeX
- Emmanuel Zarpas:
Back to the SAT05 Competition: an a Posteriori Analysis of Solver Performance on Industrial Benchmarks.
229-237
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:11:18 2009
by Michael Ley (ley@uni-trier.de)
