Bridging Constraint Satisfaction and Boolean Satisfiability / by Justyna Petke

Von:

Petke, Justyna [aut]

Resource type: Ressourcentyp: Buch (Online)Buch (Online)Sprache: Englisch Reihen: Artificial Intelligence: Foundations, Theory, and Algorithms | SpringerLink Bücher | Springer eBook Collection Computer ScienceVerlag: Cham : Springer, 2015Auflage: 1st ed. 2015Beschreibung: Online-Ressource (XI, 113 p. 19 illus, online resource)ISBN:

9783319218106

Schlagwörter:

Andere physische Formen: 9783319218090 | Druckausg.: 978-3-319-21809-0 MSC: MSC: *68-02 | 03B70 | 68Q25 | 68T15 | 68T20 | 90C09LOC-Klassifikation:

Q334-342 TJ210.2-211.495
Q334-342
TJ210.2-211.495

DOI: DOI: 10.1007/978-3-319-21810-6Online-Ressourcen:

Zusammenfassung: 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.PPN: PPN: 1657921743Package identifier: Produktsigel: ZDB-2-SCS | ZDB-2-SEB | ZDB-2-SXCS

Exemplare ( 0 )

Dieser Titel hat keine Exemplare