A Hole in Goal Trees: Some Guidance from Resolution Theory

Authors:
D. W. Loveland;M. E. Stickel
Affiliations:
Department of Computer Science, Duke University;-
Venue:
IEEE Transactions on Computers
Year:
1976

Citing 11
Cited 1

Empirical explorations with the logic theory machine: a case study in heuristics

Computers & thought
Realization of a geometry-theorem proving machine

Computers & thought
Empirical explorations of the geometry-theorem proving machine

Computers & thought
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
A Simplified Format for the Model Elimination Theorem-Proving Procedure

Journal of the ACM (JACM)
Two Results on Ordering for Resolution with Merging and Linear Format

Journal of the ACM (JACM)
A Unifying View of Some Linear Herbrand Procedures

Journal of the ACM (JACM)
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence
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
Application of theorem proving to problem solving

IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
PROW: a step toward automatic program writing

IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence

On the combination of logical and probabilistic models for information analysis

Applied Intelligence

Quantified Score

Hi-index	14.98

Visualization

Abstract

The representation power of goal-subgoal trees and the adequacy of this form of problem reduction is considered. A number of inadequacies in the classical form are illustrated, and two versions of a syntactic procedure incorporating extensions are given. Although the form of the corrections are suggested from resolution theory results, and the value of this connection emphasized, the paper discusses the goal tree format and its extensions on an informal level.