大葉大學圖書館 |

Bridging constraint satisfaction and Boolean satisfiability[electronic resource] /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	511.3
書名/作者:	Bridging constraint satisfaction and Boolean satisfiability/ by Justyna Petke.
作者:	Petke, Justyna.
出版者:	Cham : : Springer International Publishing :, 2015.
面頁冊數:	xi, 113 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Constraints (Artificial intelligence)
標題:	Algebra, Boolean.
標題:	Computer Science.
標題:	Artificial Intelligence (incl. Robotics)
標題:	Theory of Computation.
ISBN:	9783319218106
ISBN:	9783319218090
內容註:	Introduction -- Background -- Solver Performance on Tractable CSPs: Empirical Evaluation -- SAT Encodings -- From CSP to SAT: Width Restrictions -- From CSP to SAT: Language Restrictions -- SAT Encodings of a Classical Problem: A Case Study -- Conclusions.
摘要、提要註:	This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretical reasons for choosing a particular SAT encoding for several important classes of CSP instances. Boolean satisfiability and constraint satisfaction emerged independently as new fields of computer science, and different solving techniques have become standard for problem solving in the two areas. Even though any propositional formula (SAT) can be viewed as an instance of the general constraint satisfaction problem (CSP), the implications of this connection have only been studied in the last few years. The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.
電子資源:	http://dx.doi.org/10.1007/978-3-319-21810-6

Bridging constraint satisfaction and Boolean satisfiability[electronic resource] /
Petke, Justyna.

Bridging constraint satisfaction and Boolean satisfiability[electronic resource] /by Justyna Petke. - Cham :Springer International Publishing :2015. - xi, 113 p. :ill., digital ;24 cm. - Artificial intelligence: foundations, theory, and algorithms,2365-3051. - Artificial intelligence: foundations, theory, and algorithms..

Introduction -- Background -- Solver Performance on Tractable CSPs: Empirical Evaluation -- SAT Encodings -- From CSP to SAT: Width Restrictions -- From CSP to SAT: Language Restrictions -- SAT Encodings of a Classical Problem: A Case Study -- Conclusions.

This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretical reasons for choosing a particular SAT encoding for several important classes of CSP instances. Boolean satisfiability and constraint satisfaction emerged independently as new fields of computer science, and different solving techniques have become standard for problem solving in the two areas. Even though any propositional formula (SAT) can be viewed as an instance of the general constraint satisfaction problem (CSP), the implications of this connection have only been studied in the last few years. The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.

ISBN: 9783319218106

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

633949
Constraints (Artificial intelligence)

LC Class. No.: QA267.7

Dewey Class. No.: 511.3

Bridging constraint satisfaction and Boolean satisfiability[electronic resource] /
LDR:02230nam a2200337 a 4500 001 443352
003 DE-He213
005 20160324170411.0
006 m d
007 cr nn 008maaau
008 160715s2015 gw s 0 eng d
020 $a 9783319218106 $q (electronic bk.)
020 $a 9783319218090 $q (paper)
024 7 $a 10.1007/978-3-319-21810-6 $2 doi
035 $a 978-3-319-21810-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.7
072 7 $a UYQ $2 bicssc
072 7 $a TJFM1 $2 bicssc
072 7 $a COM004000 $2 bisacsh
082 0 4 $a 511.3 $2 23
090 $a QA267.7 $b .P491 2015
100 1 $a Petke, Justyna. $3 633947
245 1 0 $a Bridging constraint satisfaction and Boolean satisfiability $h [electronic resource] / $c by Justyna Petke.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a xi, 113 p. : $b ill., digital ; $c 24 cm.
490 1 $a Artificial intelligence: foundations, theory, and algorithms, $x 2365-3051
505 0 $a Introduction -- Background -- Solver Performance on Tractable CSPs: Empirical Evaluation -- SAT Encodings -- From CSP to SAT: Width Restrictions -- From CSP to SAT: Language Restrictions -- SAT Encodings of a Classical Problem: A Case Study -- Conclusions.
520 $a This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretical reasons for choosing a particular SAT encoding for several important classes of CSP instances. Boolean satisfiability and constraint satisfaction emerged independently as new fields of computer science, and different solving techniques have become standard for problem solving in the two areas. Even though any propositional formula (SAT) can be viewed as an instance of the general constraint satisfaction problem (CSP), the implications of this connection have only been studied in the last few years. The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.
650 0 $a Constraints (Artificial intelligence) $3 633949
650 0 $a Algebra, Boolean. $3 466351
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 463642
650 2 4 $a Theory of Computation. $3 464054
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Artificial intelligence: foundations, theory, and algorithms. $3 633948
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-21810-6
950 $a Computer Science (Springer-11645)