A Resolution-Based Proof Procedure Using Deletion-Directed Search

Authors:
D. Gelperin
Affiliations:
National Car Rental
Venue:
IEEE Transactions on Computers
Year:
1976

Citing 8
Cited 0

A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving

Journal of the ACM (JACM)
A Proof Procedure Using Connection Graphs

Journal of the ACM (JACM)
The predicate elimination strategy in theorem proving

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
The application of theorem proving to question-answering systems

The application of theorem proving to question-answering systems
The unit preference strategy in theorem proving

AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I
STRIPS: a new approach to the application of theorem proving to problem solving

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence

Quantified Score

Hi-index	14.98

Visualization

Abstract

The operation of a deletion-directed search strategy for resolution-based proof procedures is discussed. The strategy attempts to determine the satisfiability of a set of input clauses while at the same time minimizing the cardinality of the set of retained clauses. Distribution, a new clause deletion rule which is fundamental to the operation of the search strategy, is also described.