Studies in the logic of trees with applications to grammar formalisms
Studies in the logic of trees with applications to grammar formalisms
MOSEL: A FLexible Toolset for Monadic Second-Order Logic
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Mona: Monadic Second-Order Logic in Practice
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Feature Automata and Recognizable Sets of Feature Trees
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Algorithms for Guided Tree Automata
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
Hardware Verification using Monadic Second-Order Logic
Proceedings of the 7th International Conference on Computer Aided Verification
LISA: A Specification Language Based on WS2S
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
The intersection of finite state automata and definite clause grammars
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
A model-theoretic framework for theories of syntax
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Some Notes on the Formal Properties of Bidirectional Optimality Theory
Journal of Logic, Language and Information
wMSO theories as grammar formalisms
Theoretical Computer Science - Algebraic methods in language processing
The MSO Logic-Automaton Connection in Linguistics
LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
Constraints, Linguistic Theories and Natural Language Processing
NLP '00 Proceedings of the Second International Conference on Natural Language Processing
A descriptive characterization of tree-adjoining languages: (project note)
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Closure properties of linear context-free tree languages with an application to optimality theory
Theoretical Computer Science - Algebraic methods in language processing
| Hi-index | 0.03 |
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order (MSO) logic are represented by tree automata recognizing the assignments which make the formulas true. We show that this allows an efficient representation of knowledge about the content of constraints which can be used as a practical tool for grammatical theory verification. We achieve this by using the intertranslatability of formulae of MSO logic and tree automata and the embedding of MSO logic into a constraint logic programming scheme. The usefulness of the approach is discussed with examples from the realm of Principles-and-Parameters based parsing.