A Problem Reduction Model for Non-Independent Subproblems
Proceedings of the Fourth International Joint Conference on Artificial Intelligence. Search Techniques. Pages 340-343.
Abstract
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 prowr 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.
@inproceedings{ijcai1975p52,
title = {A Problem Reduction Model for Non-Independent Subproblems},
author = {Levi, Giorgio and Sirovich, Franco},
booktitle = {Proceedings of the Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-75}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Patrick Winston and Carl Hewitt},
pages = {340--343},
year = {1975},
note = {Search Techniques},
url = {https://ijcai.org/proceedings/1975/52},
}
TY - CPAPER TI - A Problem Reduction Model for Non-Independent Subproblems AU - Levi, Giorgio AU - Sirovich, Franco T2 - Proceedings of the Fourth International Joint Conference on Artificial Intelligence, IJCAI-75 PB - International Joint Conferences on Artificial Intelligence PY - 1975 SP - 340 EP - 343 UR - https://ijcai.org/proceedings/1975/52 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
