Cargando…
Bridging Constraint Satisfaction and Boolean Satisfiability
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 theoretica...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cham :
Springer International Publishing : Imprint: Springer,
2015.
|
| Edición: | 1st ed. 2015. |
| Colección: | Artificial Intelligence: Foundations, Theory, and Algorithms,
|
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-319-21810-6 | ||
| 003 | DE-He213 | ||
| 005 | 20220114221627.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 150810s2015 sz | 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 | |
| 050 | 4 | |a Q334-342 | |
| 050 | 4 | |a TA347.A78 | |
| 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. |e author. |0 (orcid)0000-0002-7833-6044 |1 https://orcid.org/0000-0002-7833-6044 |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 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-306X | |
| 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. | |
| 650 | 0 | |a Computer science. | |
| 650 | 1 | 4 | |a Artificial Intelligence. |
| 650 | 2 | 4 | |a Theory of Computation. |
| 710 | 2 | |a SpringerLink (Online service) | |
| 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-306X | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-3-319-21810-6 |z Texto Completo |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||