Articles liés à Bridging Constraint Satisfaction and Boolean Satisfiability
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 48,74
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Bridging Constraint Satisfaction and Boolean Satisfiability
Image fournie par le vendeur
Bridging Constraint Satisfaction and Boolean Satisfiability
Edité par
Springer International Publishing, 2016
ISBN 10 : 3319373641
ISBN 13 : 9783319373645
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Explains why SAT-solvers are efficient on certain classes of CSPsExplains which SAT encodings preserve tractability of certain classes of CSPsValuable for researchers and graduate students in artificial intelligence and theoretical comp. N° de réf. du vendeur 458604824
Quantité disponible : Plus de 20 disponibles
Image d'archives
Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783319373645_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Bridging Constraint Satisfaction and Boolean Satisfiability
Edité par
Berlin Springer International Publishing Springer Okt 2016, 2016
ISBN 10 : 3319373641
ISBN 13 : 9783319373645
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 113 pp. Englisch. N° de réf. du vendeur 9783319373645
Quantité disponible : 2 disponible(s)
Image d'archives
Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms)
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : New. N° de réf. du vendeur 6666-IUK-9783319373645
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Bridging Constraint Satisfaction and Boolean Satisfiability
Edité par
Springer, Berlin, Springer International Publishing, Springer, 2016
ISBN 10 : 3319373641
ISBN 13 : 9783319373645
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N° de réf. du vendeur 9783319373645
Quantité disponible : 2 disponible(s)
Image d'archives
Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 128. N° de réf. du vendeur 26378359026
Quantité disponible : 4 disponible(s)
Image d'archives
Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms)
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Print on Demand pp. 128. N° de réf. du vendeur 385545005
Quantité disponible : 4 disponible(s)
Image d'archives
Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms)
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. PRINT ON DEMAND pp. 128. N° de réf. du vendeur 18378359032
Quantité disponible : 4 disponible(s)
Image d'archives
Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020095804
Quantité disponible : Plus de 20 disponibles