Vol 4 (2007)

Includes a Special Issue on the 2007 Competition

Table of Contents


Disjoint DNF Tautologies with Conflict Bound Two PDF
Balazs Szoerenyi 1-14
An Extended Semidefinite Relaxation for Satisfiability PDF
Miguel F. Anjos 15-31
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results PDF
Sriyankar Acharyya 33-55
Towards a Classification of Hamiltonian Cycles in the 6-Cube PDF
Yury Chebiryak, Daniel Kroening 57-74

Special Issue on the 2007 Competitions

PicoSAT Essentials PDF
Armin Biere 75-97
Parallel SAT Solving using Bit-level Operations PDF
Marijn J.H. Heule, Hans van Maaren 99-116
Whose side are you on? Finding solutions in a biased search-tree PDF
Marijn J.H. Heule, Hans van Maaren 117-148
Combining Adaptive and Dynamic Local Search for Satisfiability PDF
Duc Nghia Pham, John Thornton, Charles Gretton, Abdul Sattar 149-172
tts: A SAT-Solver for Small, Difficult Instances PDF
Ivor Spence 173-190
Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis PDF
Knot Pipatsrisawat, Akop Palyan, Mark Chavira, Arthur Choi, Adnan Darwiche 191-217
A Switching Criterion for Intensification , and Diversification in Local Search for SAT PDF
Wanxia Wei, Chu Min Li, Harry Zhang 219-237
2006 and 2007 Max-SAT Evaluations: Contributed Instances PDF
Federico Heras, Javier Larrosa, Simon de Givry, Thomas Schiex 239-250
The First and Second Max-SAT Evaluations PDF
Josep Argelich, Chu-Min Li, Felip Manya, Jordi Planes 251-278
Guest Editors Conclusion PDF
Ewald Speckenmeyer, Armando Tacchella, Vasco Manquinho, Chu Min Li