Bridging Constraint Satisfaction and Boolean Satisfiability

Autor: Justyna Petke

Jazyk:

Väzba: Brožovaná

Vydavateľ: Springer International Publishing AG

Dostupnosť: Skladom u dodávateľa v malom množstve

Odosielame za 13-18 dní

54.22 €

This book provides a significant step towards bridging the areas of Boolean satisfiability and const...

Informácie o knihe

Autor

Justyna Petke

Jazyk

Angličtina

Väzba

Kniha - Brožovaná

Vydalo

2016

Stránok

113

EAN

9783319373645

ISBN

9783319373645

Enbook ID

15368821

Vydavateľ

Springer International Publishing AG

Hmotnosť

2058

Rozmery

155 x 235 x 8

Kompletný popis

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.

Mohlo by vás zaujímať

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

Najčastejšie vyhľadávané

Categories

Authors

Publishers

Produkty

Produkty

Najčastejšie vyhľadávané

Categories

Authors

Publishers

Produkty

Produkty

Bridging Constraint Satisfaction and Boolean Satisfiability

Informácie o knihe

Kompletný popis

Mohlo by vás zaujímať

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež