Decision Procedures: An Algorithmic Point of View (Texts in Theoretical Computer Science. An EATCS Series)

★★★★☆ 4.0 95 reviews

US$14.24
Price when purchased online
Free shipping Free 30-day returns

Sold and shipped by guest-post-italia.it
We aim to show you accurate product information. Manufacturers, suppliers and others provide what you see here.
US$14.24
Price when purchased online
Free shipping Free 30-day returns

How do you want your item?
You get 30 days free! Choose a plan at checkout.
Shipping
Arrives Aug 2
Free
Pickup
Check nearby
Delivery
Not available

Sold and shipped by guest-post-italia.it
Free 30-day returns Details

Product details

Management number 233621607 Release Date 2026/06/27 List Price US$14.24 Model Number 233621607
Category

A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry.The authors introduce the basic terminology of SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework. Then, in separate chapters, they study decision procedures for propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas. They also study the problem of deciding combined theories based on the Nelson-Oppen procedure.Thefirst edition of this book was adopted as a textbook in courses worldwide. It was published in 2008 and the field now called SMT was then in its infancy, without the standard terminology and canonic algorithms it has now; this second edition reflects these changes. It brings forward the DPLL(T) framework. It also expands the SAT chapter with modern SAT heuristics, and includes a new section about incremental satisfiability, and the related Constraints Satisfaction Problem (CSP).  The chapter about quantifiers was expanded with a new section about general quantification using E-matching and a section about Effectively Propositional Reasoning (EPR). The book also includes a new chapter on the application of SMT in industrial software engineering and in computational biology, coauthored by Nikolaj Bjørner and Leonardo de Moura, and Hillel Kugler, respectively.Each chapter includes a detailed bibliography and exercises. Lecturers’ slides and a C++ library for rapid prototyping of decision procedures are available from the authors’ website. Read more

ASIN B01MYUZDR9
XRay Not Enabled
Format Print Replica
ISBN13 978-3662504970
Edition 2nd
Language English
File size 9.1 MB
Page Flip Not Enabled
Publisher Springer
Word Wise Not Enabled
Print length 377 pages
Accessibility Learn more
Part of series Texts in Theoretical Computer Science. An EATCS
Publication date November 22, 2016
Enhanced typesetting Not Enabled

Correction of product information

If you notice any omissions or errors in the product information on this page, please use the correction request form below.

Correction Request Form

Customer ratings & reviews

4 out of 5
★★★★☆
95 ratings | 39 reviews
How item rating is calculated
View all reviews
5 stars
75% (71)
4 stars
8% (8)
3 stars
4% (4)
2 stars
2% (2)
1 star
11% (10)
Sort by

There are currently no written reviews for this product.