Propositional Logic
Deduction and Algorithms
Seiten
1999
Cambridge University Press (Verlag)
978-0-521-63017-7 (ISBN)
Cambridge University Press (Verlag)
978-0-521-63017-7 (ISBN)
- Titel ist leider vergriffen;
keine Neuauflage - Artikel merken
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.
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.
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.
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.
| Erscheint lt. Verlag | 28.8.1999 |
|---|---|
| Reihe/Serie | Cambridge Tracts in Theoretical Computer Science |
| Zusatzinfo | Worked examples or Exercises; 54 Line drawings, unspecified |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 158 x 236 mm |
| Gewicht | 675 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
| ISBN-10 | 0-521-63017-7 / 0521630177 |
| ISBN-13 | 978-0-521-63017-7 / 9780521630177 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
was jeder über Informatik wissen sollte
Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Grundlagen – Anwendungen – Perspektiven
Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 48,95
Eine Einführung in die Systemtheorie
Buch | Softcover (2022)
UTB (Verlag)
CHF 34,95
