Items related to Bridging Constraint Satisfaction and Boolean Satisfiability...
Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms) - Softcover
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.
"synopsis" may belong to another edition of this title.
About the Author
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.
From the Back Cover
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.
"About this title" may belong to another edition of this title.
Search results for Bridging Constraint Satisfaction and Boolean Satisfiability...
Stock Image
Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020095804
Quantity: Over 20 available
Seller Image
Bridging Constraint Satisfaction and Boolean Satisfiability
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 28157394-n
Quantity: 15 available
Seller Image
Bridging Constraint Satisfaction and Boolean Satisfiability
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 28157394
Quantity: 15 available
Stock Image
Bridging Constraint Satisfaction and Boolean Satisfiability (Paperback)
Published by
Springer International Publishing AG, Cham, 2016
ISBN 10: 3319373641
ISBN 13: 9783319373645
New
Paperback
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9783319373645
Quantity: 1 available
Stock Image
Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783319373645_new
Quantity: Over 20 available
Stock Image
Bridging Constraint Satisfaction and Boolean Satisfiability
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 4 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783319373645
Quantity: 10 available
Seller Image
Bridging Constraint Satisfaction and Boolean Satisfiability
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 28157394-n
Quantity: Over 20 available
Seller Image
Bridging Constraint Satisfaction and Boolean Satisfiability
Published by
Berlin Springer International Publishing Springer Okt 2016, 2016
ISBN 10: 3319373641
ISBN 13: 9783319373645
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783319373645
Quantity: 2 available
Stock Image
Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms)
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 128. Seller Inventory # 26378359026
Quantity: 4 available
Seller Image
Bridging Constraint Satisfaction and Boolean Satisfiability
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 28157394
Quantity: Over 20 available