Normal view MARC view ISBD view

Decision Procedures [electronic resource] :An Algorithmic Point of View / by Daniel Kroening, Ofer Strichman.

by Kroening, Daniel [author.]; Strichman, Ofer [author.]; SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Texts in Theoretical Computer Science, An Eatcs Series: Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.Description: online resource.ISBN: 9783540741053.Subject(s): Computer science | Software engineering | Information theory | Logic design | Artificial intelligence | Computer Science | Mathematical Logic and Formal Languages | Logics and Meanings of Programs | Theory of Computation | Software Engineering | Artificial Intelligence (incl. Robotics)DDC classification: 005.131 Online resources: Click here to access online
Contents:
and Basic Concepts -- Decision Procedures for Propositional Logic -- Equality Logic and Uninterpreted Functions -- Decision Procedures for Equality Logic and Uninterpreted Functions -- Linear Arithmetic -- Bit Vectors -- Arrays -- Pointer Logic -- Quantified Formulas -- Deciding a Combination of Theories -- Propositional Encodings.
In: Springer eBooksSummary: 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 satisfiability modulo theories and then, in separate chapters, study decision procedures for each of the following theories: 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 and dedicate a chapter to modern techniques based on an interplay between a SAT solver and a decision procedure for the investigated theory. This textbook has been used to teach undergraduate and graduate courses at ETH Zurich, at the Technion, Haifa, and at the University of Oxford. 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.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode
MAIN LIBRARY
QA8.9-QA10.3 (Browse shelf) Available

and Basic Concepts -- Decision Procedures for Propositional Logic -- Equality Logic and Uninterpreted Functions -- Decision Procedures for Equality Logic and Uninterpreted Functions -- Linear Arithmetic -- Bit Vectors -- Arrays -- Pointer Logic -- Quantified Formulas -- Deciding a Combination of Theories -- Propositional Encodings.

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 satisfiability modulo theories and then, in separate chapters, study decision procedures for each of the following theories: 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 and dedicate a chapter to modern techniques based on an interplay between a SAT solver and a decision procedure for the investigated theory. This textbook has been used to teach undergraduate and graduate courses at ETH Zurich, at the Technion, Haifa, and at the University of Oxford. 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.

There are no comments for this item.

Log in to your account to post a comment.
@ Jomo Kenyatta University Of Agriculture and Technology Library

Powered by Koha