The Resolution Calculus by Alexander Leitsch
The History of the Book In August 1992 the author had the opportunity to give a course on resolution theorem proving at the Summer School for Logic, Language, and Information in Essex. The challenge of this course (a total of five two-hour lectures) con- sisted in the selection of the topics to be presented. Clearly the first selection has already been made by calling the course resolution theorem proving instead of automated deduction . In the latter discipline a remarkable body of knowledge has been created during the last 35 years, which hardly can be presented exhaustively, deeply and uniformly at the same time. In this situ- ation one has to make a choice between a survey and a detailed presentation with a more limited scope. The author decided for the second alternative, but does not suggest that the other is less valuable. Today resolution is only one among several calculi in computational logic and automated reasoning. How- ever, this does not imply that resolution is no longer up to date or its potential exhausted. Indeed the loss of the monopoly is compensated by new appli- cations and new points of view. It was the purpose of the course mentioned above to present such new developments of resolution theory. Thus besides the traditional topics of completeness of refinements and redundancy, aspects of termination (resolution decision procedures) and of complexity are treated on an equal basis.-
Information and Randomness
-
Universal Artificial Intelligence
-
Interactive Theorem Proving and Program Development
-
Graphs and Algorithms in Communication Networks
-
Computable Analysis
-
Models of Massive Parallelism
-
Structural Complexity I
-
Models of Computation
-
Dissemination of Information in Optical Networks:
-
A Practical Theory of Reactive Systems
-
Petri Net Synthesis
-
Grammatical Picture Generation
-
Temporal Logic and State Systems
-
Algorithmics for Hard Problems
-
Simulation Algorithms for Computational Systems Biology
-
Public-Key Cryptography
-
Communication Complexity and Parallel Computing
-
Boolean Functions and Computation Models
-
Verification of Reactive Systems
-
Theoretical Computer Science
-
Introduction to Circuit Complexity
-
Elements of Finite Model Theory
-
The Parametric Lambda Calculus
-
The Complexity Theory Companion
-
Introduction to Process Algebra
-
DNA Computing
-
Abstract Computing Machines
-
Design and Analysis of Randomized Algorithms
-
Dissemination of Information in Communication Networks
-
Formal Methods for Software Engineering
-
Complexity Theory and Cryptology
-
Parsing Schemata
| SKU | Unavailable |
| ISBN 13 | 9783642644733 |
| ISBN 10 | 3642644732 |
| Title | The Resolution Calculus |
| Author | Alexander Leitsch |
| Series | Texts In Theoretical Computer Science An Eatcs Series |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer |
| Year published | 2011-09-28 |
| Number of pages | 300 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |