Directed recursive labelnode hypergraphs: A new representation-language

摘要

Directed recursive labelnode hypergraphs (DRLHs) are defined as a new representation-language combining 3 generalizations of directed labeled graphs. DRLHs are shown to overcome certain difficulties of conventional representation-languages and to be capable of specializing to them. The analysis of natural language strings into DRLHs and their processing is done with pattern-matching rules.