東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Handbook of parallel constraint reas...

Hamadi, Youssef.

FindBook

Google Book

Amazon

博客來

Handbook of parallel constraint reasoning

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Handbook of parallel constraint reasoning/ edited by Youssef Hamadi, Lakhdar Sais.
其他作者:	Hamadi, Youssef.
出版者:	Cham :Springer International Publishing : : 2018.,
面頁冊數:	xxvi, 677 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer eBooks
標題:	Constraints (Artificial intelligence) - Handbooks, manuals, etc. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-63516-3
ISBN:	9783319635163

Handbook of parallel constraint reasoning
Handbook of parallel constraint reasoning[electronic resource] /edited by Youssef Hamadi, Lakhdar Sais. - Cham :Springer International Publishing :2018. - xxvi, 677 p. :ill., digital ;24 cm.

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.

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.

ISBN: 9783319635163

Standard No.: 10.1007/978-3-319-63516-3doiSubjects--Topical Terms:

3307977
Constraints (Artificial intelligence)
--Handbooks, manuals, etc.

LC Class. No.: Q340

Dewey Class. No.: 006.3

Handbook of parallel constraint reasoning
LDR:03151nmm a2200325 a 4500 001 2136525
003 DE-He213
005 20180405060509.0
006 m d
007 cr nn 008maaau
008 181117s2018 gw s 0 eng d
020 $a 9783319635163 $q (electronic bk.)
020 $a 9783319635156 $q (paper)
024 7 $a 10.1007/978-3-319-63516-3 $2 doi
035 $a 978-3-319-63516-3
040 $a GP $c GP
041 0 $a eng
050 4 $a Q340
072 7 $a UYQ $2 bicssc
072 7 $a TJFM1 $2 bicssc
072 7 $a COM004000 $2 bisacsh
082 0 4 $a 006.3 $2 23
090 $a Q340 $b .H236 2018
245 0 0 $a Handbook of parallel constraint reasoning $h [electronic resource] / $c edited by Youssef Hamadi, Lakhdar Sais.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xxvi, 677 p. : $b ill., digital ; $c 24 cm.
505 0 $a 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.
520 $a 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.
650 0 $a Constraints (Artificial intelligence) $v Handbooks, manuals, etc. $3 3307977
650 0 $a Parallel programming (Computer science) $v Handbooks, manuals, etc. $3 3307978
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 890894
650 2 4 $a Theory of Computation. $3 892514
650 2 4 $a Operations Research/Decision Theory. $3 890895
650 2 4 $a Optimization. $3 891104
700 1 $a Hamadi, Youssef. $3 1620986
700 1 $a Sais, Lakhdar. $3 3307976
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-63516-3
950 $a Computer Science (Springer-11645)