Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal on Satisfiability, Boolean Modeling and Computation, Volume 2
Volume 2, Number 1-4, March 2006
Articles
- Daniel Le Berre, Laurent Simon:
Preface to the Special Volume on the SAT 2005 Competitions and Evaluations. - Niklas Eén, Niklas Sörensson:
Translating Pseudo-Boolean Constraints into SAT. 1-26 - Harri Haanpää, Matti Järvisalo, Petteri Kaski, Ilkka Niemelä:
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques. 27-46 - Marijn Heule
, Hans van Maaren:
March_dl: Adding Adaptive Heuristics and a New Branching Strategy. 47-59 - Oliver Kullmann:
The SAT 2005 Solver Competition on Random Instances. 61-102 - Vasco M. Manquinho, Olivier Roussel:
The First Evaluation of Pseudo-Boolean Solvers (PB'05). 103-143 - Massimo Narizzano, Luca Pulina, Armando Tacchella:
Report of the Third QBF Solvers Evaluation. 145-164 - Hossein M. Sheini, Karem A. Sakallah:
Pueblo: A Hybrid Pseudo-Boolean SAT Solver. 165-189
- Olivier Bailleux, Yacine Boufkhad, Olivier Roussel:
A Translation of Pseudo Boolean Constraints to SAT. 191-200 - Armin Biere, Carsten Sinz:
Decomposing SAT Problems into Connected Components. 201-208 - Vasco M. Manquinho, João Marques-Silva:
On Using Cutting Planes in Pseudo-Boolean Optimization. 209-219 - Klas Markström:
Locality and Hard SAT-Instances. 221-227 - Emmanuel Zarpas:
Back to the SAT05 Competition: an a Posteriori Analysis of Solver Performance on Industrial Benchmarks. 229-237
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-08 01:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
