Buy this book
- About this Textbook
-
This is a completely new presentation of resolution as a logical calculus and as a basis for computational algorithms and decision procedures.
The first part deals with the traditional topics (Herbrand's theorem, completeness of resolution, refinements and deletion) but with many new features and concepts like normalization of clauses, resolution operators, and search complexity.
Building on this foundation, the second part gives a systematic treatment of recent research topics. It is shown how resolution decision procedures can be applied to solve the decision problem for some important first-order classes. The complexity of resolution is analyzed in terms of Herbrand complexity, and new concepts like ground projection are used to classify the complexity of refinements. Finally, the method of functional extension is introduced; combined with resolution it gives a computational calculus which is stronger than most others.
- Table of contents (6 chapters)
-
-
Introduction
Pages 1-4
-
The Basis of the Resolution Calculus
Pages 5-87
-
Refinements of Resolution
Pages 89-147
-
Redundancy and Deletion
Pages 149-210
-
Resolution as Decision Procedure
Pages 211-252
-
Table of contents (6 chapters)
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- The Resolution Calculus
- Authors
-
- Alexander Leitsch
- Series Title
- Texts in Theoretical Computer Science. An EATCS Series
- Copyright
- 1997
- Publisher
- Springer-Verlag Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- eBook ISBN
- 978-3-642-60605-2
- DOI
- 10.1007/978-3-642-60605-2
- Softcover ISBN
- 978-3-642-64473-3
- Series ISSN
- 1862-4499
- Edition Number
- 1
- Number of Pages
- VIII, 300
- Topics
