rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Handbook of Parallel Constraint Reasoning
  name:
    name part: Hamadi, Youssef
    role:
      role term: editor.
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Sais, Lakhdar
    role:
      role term: editor.
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  genre: Electronic books.
  origin info:
    place:
      place term: gw
    date issued: 2018
    issuance: monographic
  language:
    language term: eng
  physical description:
    reformatting quality: access
    form: remote
    extent: 1 online resource (XXVI, 677 pages 118 illustrations, 48 illustrations in color) : online resource.
  abstract: 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.
  table of contents: Part I, Theory and Algorithms -- Parallel Satisfiability -- Cube-and-Conquer for Satisfiability -- Parallel Maximum Satisfiability -- Parallel Solving of Quantified Boolean Formulas -- Parallel Satisfiability Modulo Theories -- Parallel Theorem Proving -- Parallel Answer Set Programming -- Parallel Solvers for Mixed Integer Linear Optimization -- Parallel Constraint Programming -- Parallel Local Search -- Parallel A* for State-Space Search -- Parallel Model Checking Algorithms for Linear-Time Temporal Logic -- Multi-core Decision Diagrams -- Parallel Model-Based Diagnosis -- Part II, Tools and Applications -- Selection and Configuration of Parallel Portfolios -- An Application of Parallel Satisfiability Solving to the Verification of Complex Embedded Systems -- Parallel Constraint-Based Local Search: An Application to Designing Resilient Long-Reach Passive Optical Networks.
  note: edited by Youssef Hamadi, Lakhdar Sais.
  note: Electronic resource.
  subject:
    topic: Artificial intelligence
  subject:
    topic: Information theory
  subject:
    topic: Operations research
  subject:
    topic: Mathematical optimization
  subject:
    topic: Artificial Intelligence
  subject:
    topic: Theory of Computation
  subject:
    topic: Operations Research/Decision Theory
  subject:
    topic: Optimization
  classification: Q334-342
  classification: 006.3
  related item:
    title info:
      title: Springer eBooks
  identifier: 9783319635163
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record creation date: 180405
    record change date: 20240730205930.0
    record identifier: in00004008135