Recommendations
- Powerful and NP-complete: hypergraph Lambek grammars
- Hypergraph basic categorial grammars
- scientific article; zbMATH DE number 165817
- scientific article; zbMATH DE number 177438
- Handle-rewriting hypergraph grammars
- A hypergraph rewriting language and its semantics
- scientific article; zbMATH DE number 1787167
- Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages
- Context-free hypergraph grammars with node rewriting
- scientific article; zbMATH DE number 1268708
Cites work
- Handbook of Graph Grammars and Computing by Graph Transformation
- scientific article; zbMATH DE number 3148870 (Why is no real title available?)
- scientific article; zbMATH DE number 7456053 (Why is no real title available?)
- Hypergraph basic categorial grammars
- Lambek calculus is NP-complete
- Multimodal linguistic inference
- Powerful and NP-complete: hypergraph Lambek grammars
- Second-order abstract categorial grammars as hyperedge replacement grammars
- The Lambek calculus enriched with additional connectives
- The Mathematics of Sentence Structure
Cited in
(7)- scientific article; zbMATH DE number 165817 (Why is no real title available?)
- Specification and modelling of computing systems through graphs and graph transformation
- Spatial existential positive logics for hyperedge replacement grammars
- Multimodality in the Hypergraph Lambek Calculus
- From double pushout grammars to hypergraph Lambek grammars with and without exponential modality
- Grammars based on a logic of hypergraph languages
- Chair of Mathematical Logic and Theory of Algorithms
This page was built for publication: Hypergraph Lambek grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079680)
