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

★★★★★ 4.6 91 Bewertungen

€14.24
Preis bei Onlinekauf
Kostenloser Versand 30 Tage kostenlose Rückgabe

Verkauft und versendet von www.castellidiario.com.ar
Wir bemühen uns, Ihnen genaue Produktinformationen anzuzeigen. Hersteller, Lieferanten und andere stellen die hier gezeigten Angaben bereit.
€14.24
Preis bei Onlinekauf
Kostenloser Versand 30 Tage kostenlose Rückgabe

Wie möchten Sie Ihren Artikel erhalten?
Die ersten 30 Tage sind kostenlos! Wählen Sie den Tarif an der Kasse.
Versand
Ankunft 03.10.
Kostenlos
Abholung
In der Nähe prüfen
Lieferung
Nicht verfügbar

Verkauft und versendet von www.castellidiario.com.ar
30 Tage kostenlose Rückgabe Details

Produktdetails

Artikelnummer 233621607 Erscheinungsdatum 2026/06/27 Listenpreis €14.24 Modellnummer 233621607
Kategorie

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

Korrektur der Produktinformationen

Wenn Sie Unvollständigkeiten oder Fehler in den Produktinformationen auf dieser Seite bemerken, nutzen Sie bitte das Korrekturformular unten.

Korrekturanfrage

Kundenbewertungen

4.6 von 5
★★★★★
91 Bewertungen | 37 Rezensionen
So wird die Artikelbewertung berechnet
Alle Bewertungen anzeigen
5 Sterne
84% (76)
4 Sterne
3% (3)
3 Sterne
2% (2)
2 Sterne
1% (1)
1 Stern
10% (9)
Sortieren nach

Für dieses Produkt liegen derzeit keine schriftlichen Bewertungen vor.