Skip to main content

Handbook of Parallel Constraint Reasoning

  • Book
  • © 2018

Overview

  • Editors and authors world-leading researchers in this domain
  • Suitable for researchers, practitioners and graduate students engaged with constraint-based reasoning
  • First part addresses theory and algorithms, second part tools and applications

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (17 chapters)

  1. Theory and Algorithms

  2. Tools and Applications

Keywords

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.

Editors and Affiliations

  • Laboratoire d'informatique (LIX) de l'École polytechnique, Palaiseau, France

    Youssef Hamadi

  • CRIL, CNRS UMR 8188, Université d'Artois, Lens, France

    Lakhdar Sais

Bibliographic Information

  • Book Title: Handbook of Parallel Constraint Reasoning

  • Editors: Youssef Hamadi, Lakhdar Sais

  • DOI: https://doi.org/10.1007/978-3-319-63516-3

  • Publisher: Springer Cham

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer International Publishing AG, part of Springer Nature 2018

  • Hardcover ISBN: 978-3-319-63515-6Published: 17 April 2018

  • Softcover ISBN: 978-3-030-09694-6Published: 01 February 2019

  • eBook ISBN: 978-3-319-63516-3Published: 05 April 2018

  • Edition Number: 1

  • Number of Pages: XXVI, 677

  • Number of Illustrations: 70 b/w illustrations, 48 illustrations in colour

  • Topics: Artificial Intelligence, Theory of Computation, Operations Research/Decision Theory, Optimization

Publish with us