Bridging Constraint Satisfaction and Boolean Satisfiability / Artificial Intelligence: Foundations, Theory, and Algorithms (PDF)

Name: Bridging Constraint Satisfaction and Boolean Satisfiability / Artificial Intelligence: Foundations, Theory, and Algorithms
Brand: Springer-Verlag GmbH
SKU: 69946713
Price: 54.99 EUR
Availability: OnlineOnly

(Sprache: Englisch)

Autor: Justyna Petke

Schreiben Sie einen Kommentar zu "Bridging Constraint Satisfaction and Boolean Satisfiability / Artificial Intelligence: Foundations, Theory, and Algorithms".

Bridging Constraint Satisfaction and Boolean Satisfiability / Artificial Intelligence: Foundations, Theory, and Algorithms, Justyna Petke

Merken

Mehr zum Inhalt Autorenporträt Video

eBook (pdf) 54.99 €

Buch (Gebunden) 54.99 €

sofort als Download lieferbar

Bestellnummer: 69946713

eBook (pdf) 54.99 €

Download bestellen

Verschenken

Lastschrift, Kreditkarte, Paypal, Rechnung
Kostenloser tolino webreader

Produktdetails

Produktbeschreibung
Autorenporträt
eBook Hilfe
Biblio. Angaben / Produktdetails

Produktinformationen zu „Bridging Constraint Satisfaction and Boolean Satisfiability / Artificial Intelligence: Foundations, Theory, and Algorithms (PDF)“

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.

Autoren-Porträt von Justyna Petke

Justyna Petke received her D.Phil. from the University of Oxford. She is a Research Associate at the Centre for Research on Evolution, Search and Testing (CREST) in the Dept. of Computer Science, University College London. Her research interests include the connections between constraint satisfaction and search-based software engineering, including genetic improvement and combinatorial interaction testing.

eBook Hilfe

Informationen und Hilfe zu eBooks hier klicken!

Bibliographische Angaben

Autor: Justyna Petke
2015, 1st ed. 2015, 113 Seiten, Englisch
Verlag: Springer-Verlag GmbH
ISBN-10: 3319218107
ISBN-13: 9783319218106
Erscheinungsdatum: 25.08.2015

Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.

eBook Informationen

Dateiformat: PDF
Größe: 1.69 MB
Ohne Kopierschutz
Vorlesefunktion

Sprache:

Englisch

Kommentar zu "Bridging Constraint Satisfaction and Boolean Satisfiability / Artificial Intelligence: Foundations, Theory, and Algorithms"

Schreiben Sie einen Kommentar zu "Bridging Constraint Satisfaction and Boolean Satisfiability / Artificial Intelligence: Foundations, Theory, and Algorithms".