# Propositional Logic: Deduction and Algorithms

## Kleine Büning, Hans; Lettmann, Theodor

Valutazione media 0
( su 0 valutazioni fornite da GoodReads )

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Descrizione del libro:

This account concentrates on the algorithmic translation of important methods, especially of decision procedures for (subclasses of) propositional logic. The algorithms presented can be applied to VLSI design, deductive databases and other areas. The algorithmic approach will appeal to researchers and graduate students in computer science and logic.

Contenuti:

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Compra usato Guarda l'articolo
EUR 146,18

Spese di spedizione: GRATIS
In U.S.A.

Destinazione, tempi e costi

Aggiungere al carrello

## 1.Propositional Logic: Deduction and Algorithms (Cambridge Tracts in Theoretical Computer Science)

Editore: Cambridge University Press (1999)
ISBN 10: 0521630177 ISBN 13: 9780521630177
Usato Quantità: 1
Da
Better World Books
(Mishawaka, IN, U.S.A.)
Valutazione libreria

Descrizione libro Cambridge University Press, 1999. Condizione libro: Fair. N/A. Former Library book. Shows definite wear, and perhaps considerable marking on inside. Codice libro della libreria GRP89849607

Compra usato
EUR 146,18
Convertire valuta
Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi