First-order logic and automated theorem proving
First-order logic and automated theorem proving
Using descriptions of trees in a tree adjoining grammar
Computational Linguistics
Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
D-theory: talking about talking about trees
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Structure sharing in lexicalized tree-adjoining grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Using descriptions of trees in a tree adjoining grammar
Computational Linguistics
Dominance constraints with Boolean connectives: a model-eliminative treatment
Theoretical Computer Science - Algebraic methods in language processing
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Dominance Constraints with Set Operators
CL '00 Proceedings of the First International Conference on Computational Logic
Dominance Constraints: Algorithms and Complexity
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Computational Linguistics
Encoding Lexicalized Tree Adjoining Grammars with a nonmonotonic inheritance hierarchy
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
On determining the consistency of partial descriptions of trees
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Generating an LTAG out of a principle-based hierarchical representation
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Structure sharing in lexicalized tree-adjoining grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A principle-based hierarchical representation of LTAGs
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Determining the consistency of partial tree descriptions
Artificial Intelligence
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Research on Language and Computation
The metagrammar compiler: an NLP application with a multi-paradigm architecture
MOZ'04 Proceedings of the Second international conference on Multiparadigm Programming in Mozart/Oz
| Hi-index | 0.00 |
In this paper we introduce a logic for describing trees which allows us to reason about both the parent and domination relationship. The use of domination has found a number of applications, such as in deterministic parsers based on Description theory (Marcus, Hindle & Fleck, 1983), in a compact organization of the basic structures of Tree-Adjoining Grammars (Vijay-Shanker & Schabes, 1992), and in a new characterization of the adjoining operation that allows a clean integration of TAGs into the unification-based framework (Vijay-Shanker, 1992) Our logic serves to formalize the reasoning on which these applications are based.