A hole in goal trees: some guidance from resolution theory

Authors:
D. W. Loveland;M. E. Stickel
Affiliations:
Computer Science Department, Duke University, Durham, N.C. and Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA;Computer Science Department, Duke University, Durham, N.C. and Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA
Venue:
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Year:
1973

Citing 9
Cited 3

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

A problem reduction model for non independent subproblems

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Reasoning in the presence of inconsistency

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Reasoning in the presence of inconsistency

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

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.