國立虎尾科技大學 |

Bridging Constraint Satisfaction and Boolean Satisfiability

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Bridging Constraint Satisfaction and Boolean Satisfiability/ by Justyna Petke.
Author:	Petke, Justyna.
Description:	XI, 113 p. 19 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Artificial intelligence. -
Online resource:	https://doi.org/10.1007/978-3-319-21810-6
ISBN:	9783319218106

Bridging Constraint Satisfaction and Boolean Satisfiability
Petke, Justyna.

Bridging Constraint Satisfaction and Boolean Satisfiability[electronic resource] /by Justyna Petke. - 1st ed. 2015. - XI, 113 p. 19 illus.online resource. - 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:

559380
Artificial intelligence.

LC Class. No.: Q334-342

Dewey Class. No.: 006.3

Bridging Constraint Satisfaction and Boolean Satisfiability
LDR:02607nam a22004095i 4500 001 961102
003 DE-He213
005 20200705135211.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319218106 $9 978-3-319-21810-6
024 7 $a 10.1007/978-3-319-21810-6 $2 doi
035 $a 978-3-319-21810-6
050 4 $a Q334-342
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 006.3 $2 23
100 1 $a Petke, Justyna. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1067744
245 1 0 $a Bridging Constraint Satisfaction and Boolean Satisfiability $h [electronic resource] / $c by Justyna Petke.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a XI, 113 p. 19 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
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 Artificial intelligence. $3 559380
650 0 $a Computers. $3 565115
650 1 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Theory of Computation. $3 669322
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319218113
776 0 8 $i Printed edition: $z 9783319218090
776 0 8 $i Printed edition: $z 9783319373645
830 0 $a Artificial Intelligence: Foundations, Theory, and Algorithms, $x 2365-3051 $3 1255341
856 4 0 $u https://doi.org/10.1007/978-3-319-21810-6
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)