000 02835nam a22004335i 4500
999 _c200433853
_d52065
003 DE-He213
005 20231104114229.0
007 cr nn 008mamaa
008 150810s2015 gw | s |||| 0|eng d
020 _a9783319218106
_z978-3-319-21810-6
024 7 _a10.1007/978-3-319-21810-6
_2doi
040 _aTR-AnTOB
_beng
_cTR-AnTOB
_erda
050 4 _aQ334-342
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema006.3
_223
100 1 _aPetke, Justyna.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aBridging Constraint Satisfaction and Boolean Satisfiability /
_cby Justyna Petke.
250 _a1st ed. 2015.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _a1 online resource
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 0 _aArtificial Intelligence: Foundations, Theory, and Algorithms,
_x2365-3051
505 0 _aIntroduction -- 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 _aThis 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 _aArtificial intelligence.
650 0 _aInformation theory.
650 1 4 _aArtificial Intelligence.
_0http://scigraph.springernature.com/things/product-market-codes/I21000
650 2 4 _aTheory of Computation.
_0http://scigraph.springernature.com/things/product-market-codes/I16005
710 2 _aSpringerLink (Online service)
856 4 0 _3Springer eBooks
_zOnline access link to the resource
_uhttps://doi.org/10.1007/978-3-319-21810-6
942 _2lcc
_cEBK
041 _aeng