Resolution Proof Systems: An Algebraic Theory

Front Cover
Springer Netherlands, Apr 30, 1996 - Computers - 208 pages
Resolution Proof Systems: An Algebraic Theory 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.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

LOGICAL PRELIMINARIES
1
PROPOSITIONAL RESOLUTION PROOF
23
PROPOSITIONAL RESOLUTION LOGICS
47
Copyright

9 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information