Decision procedures : an algorithmic point of view
著者
書誌事項
Decision procedures : an algorithmic point of view
（Texts in theoretical computer science, An EATCS series）
Springer, c2008
大学図書館所蔵 件 / 全16件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. [285]-297) and index
内容説明・目次
内容説明
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.
目次
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.
「Nielsen BookData」 より