Bridging Constraint Satisfaction and Boolean Satisfiability
(Sprache: Englisch)
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...
Jetzt vorbestellen
versandkostenfrei
Buch (Gebunden)
Fr. 59.00
inkl. MwSt.
- Kreditkarte, Paypal, Rechnungskauf
- 30 Tage Widerrufsrecht
Produktdetails
Produktinformationen zu „Bridging Constraint Satisfaction and Boolean Satisfiability “
Klappentext zu „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 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.
This book represents a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by providing theoretical explanations for why SAT-solvers are efficient on certain classes of CSPs and under which SAT encodings tractability of the original CSP instance is preserved.
These fields emerged independently, and they developed different standard problem-solving solutions. In the meantime it is understood that any propositional formula can actually be viewed as an instance of the general constraint satisfaction problem, but the implications of this connection have only been studied in the last few years.
This book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.
These fields emerged independently, and they developed different standard problem-solving solutions. In the meantime it is understood that any propositional formula can actually be viewed as an instance of the general constraint satisfaction problem, but the implications of this connection have only been studied in the last few years.
This book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.
Inhaltsverzeichnis zu „Bridging Constraint Satisfaction and Boolean Satisfiability “
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.
Autoren-Porträt von Justyna Petke
Justyna Petke received her D.Phil. from the University of Oxford. She is a Research Associate at the Centre for Research on Evolution, Search and Testing (CREST) in the Dept. of Computer Science, University College London. Her research interests include the connections between constraint satisfaction and search-based software engineering, including genetic improvement and combinatorial interaction testing.
Bibliographische Angaben
- Autor: Justyna Petke
- 2015, 1st ed. 2015, XI, 113 Seiten, Masse: 16 x 24,1 cm, Gebunden, Englisch
- Verlag: Springer, Berlin
- ISBN-10: 3319218093
- ISBN-13: 9783319218090
- Erscheinungsdatum: 19.08.2015
Sprache:
Englisch
Kommentar zu "Bridging Constraint Satisfaction and Boolean Satisfiability"
0 Gebrauchte Artikel zu „Bridging Constraint Satisfaction and Boolean Satisfiability“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Bridging Constraint Satisfaction and Boolean Satisfiability".
Kommentar verfassen