Bridging Constraint Satisfaction and Boolean Satisfiability

AvJustyna Petke

Häftad, Engelska, 2016

Del i serien Artificial Intelligence: Foundations, Theory, and Algorithms

552 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

552 kr

Skickas inom 10-15 vardagar

Beskrivning

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.

Produktinformation

Utgivningsdatum:2016-10-22
Mått:155 x 235 x undefined mm
Format:Häftad
Språk:Engelska
Serie:Artificial Intelligence: Foundations, Theory, and Algorithms
Antal sidor:113
Förlag:Springer International Publishing AG
ISBN:9783319373645

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT

Mer om författaren

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.

Innehållsförteckning

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.