© 1997

The Resolution Calculus


Table of contents

  1. Front Matter
    Pages I-VIII
  2. Alexander Leitsch
    Pages 1-4
  3. Alexander Leitsch
    Pages 5-87
  4. Alexander Leitsch
    Pages 89-147
  5. Alexander Leitsch
    Pages 149-210
  6. Alexander Leitch
    Pages 211-252
  7. Alexander Leitsch
    Pages 253-287
  8. Back Matter
    Pages 289-300

About this book


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.


Decision Decision Procederes Deduction Resolution algorithms calculus complexity

Authors and affiliations

  1. 1.Intitut für ComputersprachenTechnische Universität WienWienAustria

Bibliographic information