The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Narrowness, pathwidth, and their application in natural language processing
Discrete Applied Mathematics
Graph searching and a min-max theorem for tree-width
Journal of Combinatorial Theory Series B
Handbook of formal languages, vol. 3
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Tree acceptors and some of their applications
Journal of Computer and System Sciences
Millstream systems: a formal model for linking language modules by interfaces
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Incremental construction of millstream configurations using graph transformation
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Hi-index | 0.00 |
Millstream systems have recently been proposed as a formalization of the linguistic idea that natural language should be described as a combination of different modules related by interfaces. In this paper we investigate algorithmic properties of Millstream systems having regular tree grammars as modules and MSO logic as interface logic. We focus on the so-called completion problem: Given trees generated by a subset of the modules, can they be completed into a valid configuration of the Millstream system?