9781586039295-1586039296-Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications

Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications

ISBN-13: 9781586039295
ISBN-10: 1586039296
Author: A. Biere, M. Heule, H. Van Maaren, T. Walsh
Publication date: 2009
Publisher: IOS Press
Format: Hardcover 980 pages
FREE US shipping

Book details

ISBN-13: 9781586039295
ISBN-10: 1586039296
Author: A. Biere, M. Heule, H. Van Maaren, T. Walsh
Publication date: 2009
Publisher: IOS Press
Format: Hardcover 980 pages

Summary

Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications (ISBN-13: 9781586039295 and ISBN-10: 1586039296), written by authors A. Biere, M. Heule, H. Van Maaren, T. Walsh, was published by IOS Press in 2009. With an overall rating of 3.6 stars, it's a notable title among other AI & Machine Learning (Computer Science) books. You can easily purchase or rent Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications (Hardcover) from BooksRun, along with many other new and used AI & Machine Learning books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $0.3.

Description

'Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic, applied areas such as planning, scheduling, operations research and combinatorial optimization, but also theoretical issues on the theme of complexity and much more, they all are connected through SAT. My personal interest in SAT stems from actual solving: The increase in power of modern SAT solvers over the past 15 years has been phenomenal. It has become the key enabling technology in automated verification of both computer hardware and software. Bounded Model Checking (BMC) of computer hardware is now probably the most widely used model checking technique. The counterexamples that it finds are just satisfying instances of a Boolean formula obtained by unwinding to some fixed depth a sequential circuit and its specification in linear temporal logic. Extending model checking to software verification is a much more difficult problem on the frontier of current research. One promising approach for languages like C with finite word-length integers is to use the same idea as in BMC but with a decision procedure for the theory of bit-vectors instead of SAT. All decision procedures for bit-vectors that I am familiar with ultimately make use of a fast SAT solver to handle complex formulas. Decision procedures for more complicated theories, like linear real and integer arithmetic, are also used in program verification. Most of them use powerful SAT solvers in an essential way. Clearly, efficient SAT solving is a key technology for 21st century computer science. I expect this collection of papers on all theoretical and practical aspects of SAT solving will be extremely useful to both students and researchers and will lead to many further advances in the field.'
Edmund Clarke (Winner of the 2007 A.M. Turing Award & FORE Systems University Professor of Computer Science and Professor of Electrical and Computer Engineering at Carnegie Mellon University)

IOS Press is an international science, technical and medical publisher of high-quality books for academics, scientists, and professionals in all fields.

Some of the areas we publish in:

-Biomedicine
-Oncology
-Artificial intelligence
-Databases and information systems
-Maritime engineering
-Nanotechnology
-Geoengineering
-All aspects of physics
-E-governance -E-commerce
-The knowledge economy
-Urban studies
-Arms control
- Understanding and responding to terrorism
- Medical informatics
- Computer Sciences

Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book