Levi G., Sirovich F. A problem reduction model for non independent subproblems. Internal note IEI-B75-02, 1975. |

Abstract (English) |
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 since the conjuncts may be non independent. 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. | |

Subject |

1) Download Document PDF |

Open access Restricted Private