Bridging Constraint Satisfaction and Boolean Satisfiability

Автор: Justyna Petke

Език:

Корици: С меки корици

Издател: Springer International Publishing AG

Наличност: Външен склад

Изпращаме след 9-15 дни

56.91 € 111.30 лв

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

Информация за книгата

Автор

Justyna Petke

Език

Английски език

Корици

Книга - С меки корици

Издадена

2016

страници

113

EAN

9783319373645

ISBN

9783319373645

Enbook ID

15368821

Издател

Springer International Publishing AG

Теглоt

2058

Размери

155 x 235 x 8

Пълно описание

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.

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Bridging Constraint Satisfaction and Boolean Satisfiability

Информация за книгата

Пълно описание

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също