State-space problem-reduction, and theorem proving—some relationships
Communications of the ACM
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
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
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
A hole in goal trees: some guidance from resolution theory
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
| Hi-index | 0.00 |
A hypergraph model is introduced, which besides including the AND/OR graph and state space graph models as particulars, is adequate for problem solving tasks involving non independent subproblems. The hypergraph model is shown to be grounded on a nonstandard notion of conjunction such that the truth of a conjunction does not necessarily imply the truth of the conjuncts. A hypergraph search algorithm is given and shown to be equivalent to a resolution-based theorem prover in a first order logic augmented with the special conjunction. A characterization is given of the class of problems requiring the full descriptive power of our model. The class includes problems involving resources, plan formation, simplification of predicate logic programs.