000733726 000__ 02969cam\a2200493Ii\4500
000733726 001__ 733726
000733726 005__ 20230306141101.0
000733726 006__ m\\\\\o\\d\\\\\\\\
000733726 007__ cr\cn\nnnunnun
000733726 008__ 150826s2015\\\\sz\a\\\\ob\\\\000\0\eng\d
000733726 019__ $$a919342832
000733726 020__ $$a9783319218106$$qelectronic book
000733726 020__ $$a3319218107$$qelectronic book
000733726 020__ $$z9783319218090
000733726 020__ $$z3319218093
000733726 0247_ $$a10.1007/978-3-319-21810-6$$2doi
000733726 035__ $$aSP(OCoLC)ocn919201255
000733726 035__ $$aSP(OCoLC)919201255$$z(OCoLC)919342832
000733726 040__ $$aN$T$$beng$$erda$$epn$$cN$T$$dN$T$$dGW5XE$$dIDEBK$$dYDXCP$$dCDX$$dCOO$$dOCLCF
000733726 049__ $$aISEA
000733726 050_4 $$aQA267.7
000733726 08204 $$a511.3$$223
000733726 1001_ $$aPetke, Justyna,$$eauthor.
000733726 24510 $$aBridging constraint satisfaction and Boolean satisfiability$$h[electronic resource] /$$cJustyna Petke.
000733726 264_1 $$aSwitzerland :$$bSpringer,$$c[2015]
000733726 264_4 $$c©2015
000733726 300__ $$a1 online resource :$$billustrations
000733726 336__ $$atext$$btxt$$2rdacontent
000733726 337__ $$acomputer$$bc$$2rdamedia
000733726 338__ $$aonline resource$$bcr$$2rdacarrier
000733726 4901_ $$aArtificial intelligence : foundations, theory and algorithms
000733726 504__ $$aIncludes bibliographical references.
000733726 5050_ $$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. .
000733726 506__ $$aAccess limited to authorized users.
000733726 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. .
000733726 588__ $$aOnline resource; title from PDF title page (viewed August 27, 2015).
000733726 650_0 $$aConstraints (Artificial intelligence)
000733726 650_0 $$aAlgebra, Boolean.
000733726 77608 $$iPrint version:$$z3319218093$$z9783319218090$$w(OCoLC)911363637
000733726 830_0 $$aArtificial intelligence (Berlin, Germany)
000733726 852__ $$bebk
000733726 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-21810-6$$zOnline Access$$91397441.1
000733726 909CO $$ooai:library.usi.edu:733726$$pGLOBAL_SET
000733726 980__ $$aEBOOK
000733726 980__ $$aBIB
000733726 982__ $$aEbook
000733726 983__ $$aOnline
000733726 994__ $$a92$$bISE