Bridging Constraint Satisfaction and Boolean Satisfiability (Record no. 52247)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02902nam a22005055i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-319-21810-6 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200420220227.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 150810s2015 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783319218106 |
| -- | 978-3-319-21810-6 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 006.3 |
| 100 1# - AUTHOR NAME | |
| Author | Petke, Justyna. |
| 245 10 - TITLE STATEMENT | |
| Title | Bridging Constraint Satisfaction and Boolean Satisfiability |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2015. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XI, 113 p. 19 illus. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Artificial Intelligence: Foundations, Theory, and Algorithms, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | 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 ## - SUMMARY, ETC. | |
| Summary, etc | 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. . |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-319-21810-6 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2015. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computers. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Artificial intelligence. |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Artificial Intelligence (incl. Robotics). |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Theory of Computation. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 2365-3051 |
| 912 ## - | |
| -- | ZDB-2-SCS |
No items available.