PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Levi G., Sirovich F. Generalized and/or graphs and their relation to type 0 grammars. Internal note IEI-B73-15, 1973.
 
 
Abstract
(English)
A generalization of AND/OR graphs is introduced as a problem solving model, in which subproblem interdependence in 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. Generalized AND/OR graphs are 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 are given as to potential equivalence. type 0 grammar. Indications are given as to potential implications of such an equivalence.
Subject


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional