Handbook of Parallel Constraint Reasoning - Rilegato

 
9783319635156: Handbook of Parallel Constraint Reasoning
Rilegato
ISBN 10: 3319635158 ISBN 13: 9783319635156
Casa editrice: Springer-Nature New York Inc, 2018

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Dalla quarta di copertina

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Springer-Nature New York Inc
Data di pubblicazione
2018
Lingua
Inglese
ISBN 10 
3319635158
ISBN 13 
9783319635156
Rilegatura
Copertina rigida
Numero edizione
1
Numero di pagine
677
Redattore
Hamadi Youssef, Sais Lakhdar
Contatto del produttore
non disponibile
Persona responsabile
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Germania

Altre edizioni note dello stesso titolo

9783030096946: Handbook of Parallel Constraint Reasoning

Edizione in evidenza

ISBN 10:  3030096947 ISBN 13:  9783030096946
Casa editrice: Springer-Nature New York Inc, 2019
Brossura