An Evaluation of an Implementation of Qualified Hyperresolution

Authors:
S. K. Winker
Affiliations:
Department of Computer Science, Northern Illinois University
Venue:
IEEE Transactions on Computers
Year:
1976

Citing 2
Cited 2

The Concept of Demodulation in Theorem Proving

Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving

Introduction Tutorial on Resolution

IEEE Transactions on Computers
Automated deduction by theory resolution

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	14.98

Visualization

Abstract

A new inference rule for resolution based theorem proving, termed qualified hyperresolution, is presented from a practical point of view. The method of qualification is intended to deal with clause sets involving not-everywhere-defined functions. Two examples illustrating the effects of the method are discussed in detail. The potential practical value of the method is indicated by substantial improvements over the performance of ordinary hyperresolution obtained in five test problems.