Propositional logic : deduction and algorithms
Author(s)
Bibliographic Information
Propositional logic : deduction and algorithms
（Cambridge tracts in theoretical computer science, 48）
Cambridge University Press, 1999
Available at / 39 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 385-402) and index
First published in German by B.G.Teubner in 1994
Description and Table of Contents
Description
This account of propositional logic concentrates on the algorithmic translation of important methods, especially of decision procedures for (subclasses of) propositional logic. Important classical results and a series of new results taken from the fields of normal forms, satisfiability and deduction methods are arranged in a uniform and complete theoretic framework. The algorithms presented can be applied to VLSI design, deductive databases and other areas. After introducing the subject the authors discuss satisfiability problems and satisfiability algorithms with complexity considerations, the resolution calculus with different refinements, and special features and procedures for Horn formulas. Then, a selection of further calculi and some results on the complexity of proof procedures are presented. The last chapter is devoted to quantified boolean formulas. The algorithmic approach will make this book attractive to computer scientists and graduate students in areas such as automated reasoning, logic programming, complexity theory and pure and applied logic.
Table of Contents
- 1. Introduction to propositional logic
- 2. Data structures and normal forms
- 3. Satisfiability
- 4. Resolution
- 5. Horn logic
- 6. Calculi
- 7. Quantified formulas
- Bibliography
- List of symbols
- List of algorithms
- Index.
by "Nielsen BookData"
