Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms) - Hardcover

Buch 1 von 15: Artificial Intelligence: Foundations, Theory, and Algorithms

Petke, Justyna

 
9783319218090: Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms)
Hardcover
ISBN 10: 3319218093 ISBN 13: 9783319218090
Verlag: Springer, 2015

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

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.

Von der hinteren Coverseite

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Springer
Erscheinungsdatum
2015
Sprache
Englisch
ISBN 10 
3319218093
ISBN 13 
9783319218090
Einband
Tapa dura
Auflage
1
Anzahl der Seiten
128
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Deutschland

Weitere beliebte Ausgaben desselben Titels

9783319373645: Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms)

Vorgestellte Ausgabe

ISBN 10:  3319373641 ISBN 13:  9783319373645
Verlag: Springer, 2016
Softcover