Deduction Systems /
This graduate-level text offers a theoretical treatment of the fundamental concepts and methods of automated deduction. By presenting an account which covers resolution theorem-proving in order-sorted first-order logic it provides a self-contained account suitable for students coming to the subject...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | |
| Format: | eBook |
| Language: | English |
| Published: |
New York, NY :
Springer New York,
1997.
|
| Series: | Graduate texts in computer science.
|
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
Table of Contents:
- Mathematical Preliminaries
- Syntax of first-order languages
- Semantics of first-order languages
- The Gentzen calculus G. Normal Forms and Herbrand's Theorem
- Resolution and unification
- Improved Deduction efficiency
- Resolution in sorted logic.