Handbook of Parallel Constraint Reasoning

  • Youssef Hamadi
  • Lakhdar Sais

Table of contents

  1. Front Matter
    Pages i-xxvi
  2. Theory and Algorithms

    1. Front Matter
      Pages 1-1
    2. Tomáš Balyo, Carsten Sinz
      Pages 3-29
    3. Marijn J. H. Heule, Oliver Kullmann, Armin Biere
      Pages 31-59
    4. Inês Lynce, Vasco Manquinho, Ruben Martins
      Pages 61-99
    5. Florian Lonsing, Martina Seidl
      Pages 101-139
    6. Antti E. J. Hyvärinen, Christoph M. Wintersteiger
      Pages 141-178
    7. Maria Paola Bonacina
      Pages 179-235
    8. Agostino Dovier, Andrea Formisano, Enrico Pontelli
      Pages 237-282
    9. Ted Ralphs, Yuji Shinano, Timo Berthold, Thorsten Koch
      Pages 283-336
    10. Jean-Charles Régin, Arnaud Malapert
      Pages 337-379
    11. Philippe Codognet, Danny Munera, Daniel Diaz, Salvador Abreu
      Pages 381-417
    12. Alex Fukunaga, Adi Botea, Yuu Jinnai, Akihiro Kishimoto
      Pages 419-455
    13. Jiri Barnat, Vincent Bloemen, Alexandre Duret-Lutz, Alfons Laarman, Laure Petrucci, Jaco van de Pol et al.
      Pages 457-507
    14. Tom van Dijk, Jaco van de Pol
      Pages 509-545
    15. Kostyantyn Shchekotykhin, Dietmar Jannach, Thomas Schmitz
      Pages 547-580
  3. Tools and Applications

    1. Front Matter
      Pages 581-581
    2. Marius Lindauer, Holger Hoos, Frank Hutter, Kevin Leyton-Brown
      Pages 583-615
    3. Orlando Ferrante, Alberto Ferrari, Christos Sofronis, Leonardo Mangeruca, Luca Benvenuti
      Pages 617-632
    4. Alejandro Arbelaez, Deepak Mehta, Barry O’Sullivan, Luis Quesad
      Pages 633-665
  4. Back Matter
    Pages 667-677

About this book


This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units.

The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP),  constraint programming (CP), stochastic local search (SLS), optimal path finding with A*, model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD).

The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning.


Parallel Solving Satisfiability (SAT) MaxSAT SAT Modulo Theory (SMT) Quantified Boolean Formulas (QBF) Constraint Programming (CP) Local Search Answer Set Programming (ASP) Theorem Proving (TP) Algorithm Configuration Algorithm Selection

Editors and affiliations

  • Youssef Hamadi
    • 1
  • Lakhdar Sais
    • 2
  1. 1.Laboratoire d'informatique (LIX) de l'École polytechniquePalaiseauFrance
  2. 2.CRIL, CNRS UMR 8188Université d'ArtoisLensFrance

Bibliographic information