Bridging Constraint Satisfaction and Boolean Satisfiability

Autor: Justyna Petke

Jazyk:

Vazba: Brožovaná

Vydavatel: Springer International Publishing AG

Dostupnost: Skladem u dodavatele v malém množství

Odesíláme za 13-18 dnů

1 310 Kč

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

Informace o knize

Autor

Justyna Petke

Jazyk

Angličtina

Vazba

Kniha - Brožovaná

Vydáno

2016

Stránek

113

EAN

9783319373645

ISBN

9783319373645

Enbook ID

15368821

Vydavatel

Springer International Publishing AG

Hmotnost

2058

Rozměry

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 zajímat

Zákaznicí kteří koupili tuto knihu koupili také

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Bridging Constraint Satisfaction and Boolean Satisfiability

Informace o knize

Kompletní popis

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také