Stachniak Resolution Proof Systems

An Algebraic Theory
1996
ISBN: 978-94-009-1677-7
Verlag: Springer Netherland
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, Band 4, 208 Seiten, eBook

Reihe: Automated Reasoning Series

presents a new algebraic framework for the design and analysis of resolution- based automated reasoning systems for a range of non-classical logics. It develops an algebraic theory of resolution proof systems focusing on the problems of proof theory, representation and efficiency of the deductive process.
A new class of logical calculi, the class of resolution logics, emerges as a second theme of the book. The logical and computational aspects of the relationship between resolution logics and resolution proof systems is explored in the context of monotonic as well as nonmonotonic reasoning.
This book is aimed primarily at researchers and graduate students in artificial intelligence, symbolic and computational logic. The material is suitable as a reference book for researchers and as a text book for graduate courses on the theoretical aspects of automated reasoning and computational logic.

Zielgruppe

Research

Autoren/Hrsg.

Stachniak, Z.

Inhaltsverzeichnis

Preface. 1. Logical Preliminaries. 2. Propositional Resolution Proof Systems. 3. Propositional Resolution Logics. 4. Efficiency of the Deductive Process. 5. Theorem Proving Strategies. 6. Resolution Circuits. 7. First-Order Resolution Proof Systems. 8. Nonmonotonic Resolution Inference Systems. A. Resolution Counterpart of P2. B. Resolution Counterpart of P3. C. Resolution Counterpart of P4. D. Resolution Counterpart of P5. E. Resolution Counterpart of P*3. F. Resolution Counterpart of PS. References. Index. Index of Symbols.