The craft of Prolog
Description theory and intonation boundaries
Cognitive models of speech processing
Description theory, licensing theory, and principle-based grammars and parsers
Description theory, licensing theory, and principle-based grammars and parsers
Maintaining knowledge about temporal intervals
Communications of the ACM
D-theory: talking about talking about trees
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Reasoning with descriptions of trees
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
An efficient algorithm for the configuration problem of dominance graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Talking about Trees and Truth-Conditions
Journal of Logic, Language and Information
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
An efficient graph algorithm for dominance constraints
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
On underspecified processing of dynamic semantics
COLING '00 Proceedings of the 18th 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
The core of a countably categorical structure
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
We examine the consistency problem for descriptions of trees based on remote dominance, and present a consistency-checking algorithm which is polynomial in the number of nodes in the description, despite disjunctions inherent in the theory of trees. The resulting algorithm allows for descriptions which go beyond sets of atomic formulas to allow certain types of disjunction and negation.