Deletion-directed search in resolution-based proof procedures

Authors:
David Gelperin
Affiliations:
Computer Science Department, Technion, Haifa, Israel and Department of Computer and Information Science, The Ohio State University, Columbus, Ohio
Venue:
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Year:
1973

Citing 7
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)
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
Clause-deletion in resolution theorem-proving.

Clause-deletion in resolution theorem-proving.
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

Quantified Score

Hi-index	0.00

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. E-representation, a new clause deletion rule which is fundamental to the operation of the search strategy, is also described.