Free delivery for orders over 69.99 euro.

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 69.99 €

DPD courier 5.99 € Bpost point 7.99 € Bpost 7.49 € DPD point 3.49 € GLS courier 4.49 €

Contact

How to shop

Help

My account

▸ Empty :-(

Free delivery for orders over 69.99 euro.

Bridging Constraint Satisfaction and Boolean Satisfiability

Justyna Petke

Language

English

Book Paperback

Libristo code: 15368821

Publishers Springer International Publishing AG, October 2016

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

Libristo code: 15368821

141 b

58.53 €

Low in stock at our supplier Shipping in 13-18 days

30-day return policy

Customers also purchased

Los Compas escapan de la prisión (nueva presentación) EL TROLLINO Y TIMBA VK MIKECRACK

Hardback

19.03 €

Optische Erfassung von Gefügeumwandlungen in Stählen: Eine innovative Methode zur zeit- und kosteneffizienten Werkstoffcharakterisierung

Paperback

18.93 €

KINESIOTAPING EN MEDICINA ESTETICA BELLIA

Book

164.57 €

Tandem - Maths CE1 - Fichier de l'élève + Cahier géométrie Stéphanie Collomb

Paperback

15.69 €

Konzeption eines integrierten Planungs- und Kontrollsystems fur Nonprofit Organisationen am Beispiel des Deutschen Komitee der AIESEC e.V. Ulf-Wedig von der Osten

Paperback

60.66 €

Werbewirkungsanalyse Mit Expertensystemen Bruno Neibecker

Paperback

53.16 €

Tres semanas de mal dormir José María Merino

Paperback

19.13 €

Schönrich, G: Zeichenhandeln Gerhard Schönrich

Hardback

30.48 €

scala degli idioti di Gurdjieff. I 21 gradini dell'evoluzione spirituale Patrick Négrier

Paperback

20.55 €

Bonnets et chapeaux au crochet Armani

Hardback

19.33 €

Sancey, Chef Du Deuxieme Bataillon de la Moselle, En Reponse A Laver, Capitaine Audit ""

Paperback

12.75 €

I Medici Ed Il Diritto Romano (1904) Roberto Bozzoni

Hardback

43.03 €

Patrick Melrose: Nerieš to Edward St. Aubyn

Paperback

12.55 €

Premieres Lectures d'Economie Rurale: Les Cultures Et Les Betes MEHEUST-P

Paperback

16.50 €

Notice Historique Sur La Fondation de la Societe de l'Union Des Travailleurs Du Tour-De-France Marquet-J

Paperback

27.23 €

Fuhrungspersoenlichkeiten in kreativwirtschaftlichen Betrieben. Diversitat und Komplexitat der kreativen Fuhrung Kurt Arbter

Paperback

42.83 €

Witches - Hexenzirkel Pia Hepke

Paperback

11.33 €

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.