Grammars Based on a Logic of Hypergraph Languages

The hyperedge replacement grammar (HRG) formalism is a natural and well-known generalization of context-free grammars. HRGs inherit number properties grammars, e.g. the pumping lemma. This lemma turns out to be strong restriction in hypergraph case: it implies that languages unbounded connectivity cannot generated by HRGs. We introduce more powerful than while having same algorithmic complexity (NP-complete). Namely, we Lambek grammars; they are based on calculus, which may considered as logic languages. explain underlying principles establish their basic properties, show some can them (e.g. language all graphs, bipartite regular graphs).