Dekorationsartikel gehören nicht zum Leistungsumfang.
Bridging Constraint Satisfaction and Boolean Satisfiability
Taschenbuch von Justyna Petke
Sprache: Englisch

53,49 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Aktuell nicht verfügbar

Kategorien:
Beschreibung
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.

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.

Inhaltsverzeichnis
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.
Details
Medium: Taschenbuch
Seiten: 113
Inhalt: xi
113 S.
19 s/w Illustr.
113 p. 19 illus.
ISBN-13: 9783319373645
ISBN-10: 3319373641
Sprache: Englisch
Herstellernummer: 978-3-319-37364-5
Ausstattung / Beilage: Previously published in hardcover
Autor: Petke, Justyna
Auflage: Softcover reprint of the original 1st ed. 2015
Hersteller: Springer
Springer, Berlin
Springer International Publishing
Abbildungen: XI, 113 p. 19 illus.
Maße: 8 x 156 x 235 mm
Von/Mit: Justyna Petke
Erscheinungsdatum: 22.10.2016
Gewicht: 0,209 kg
preigu-id: 111861941
Inhaltsverzeichnis
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.
Details
Medium: Taschenbuch
Seiten: 113
Inhalt: xi
113 S.
19 s/w Illustr.
113 p. 19 illus.
ISBN-13: 9783319373645
ISBN-10: 3319373641
Sprache: Englisch
Herstellernummer: 978-3-319-37364-5
Ausstattung / Beilage: Previously published in hardcover
Autor: Petke, Justyna
Auflage: Softcover reprint of the original 1st ed. 2015
Hersteller: Springer
Springer, Berlin
Springer International Publishing
Abbildungen: XI, 113 p. 19 illus.
Maße: 8 x 156 x 235 mm
Von/Mit: Justyna Petke
Erscheinungsdatum: 22.10.2016
Gewicht: 0,209 kg
preigu-id: 111861941
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte