Levi G., Sirovich F. Generalized and-or graphs. In: Artificial Intelligence, (7) pp. 243 - 259. North-Holland Publishing Company, 1976. |

Abstract (English) |
A generalization of AND/OR graphs is introduced as a problem solving model, in which subproblem interdependence in a problem reduction can be explicitly accounted for. An ordered-search algorithm is given to find a solution. The algorithm is proven to be admissible and optimal. Examples are given which show the application of the formalism to problems which cannot be modelled by AND/OR graphs. Generalized AND/OR graphs are finally shown to be equivalent to type 0 grammars. Finding a solution of a generalized AND/OR graph is shown to be equivalent to deriving a sentence in the corresponding type 0 grammar. | |

Subject |

1) Download Document PDF |

Open access Restricted Private