A polynomial-time fragment of dominance constraints

Authors:
Alexander Koller;Kurt Mehlhorn;Joachim Niehren
Affiliations:
University of the Saarland, Saarbrücken, Germany;Max-Planck-Institute for Computer Science;University of the Saarland, Saarbrücken, Germany
Venue:
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Year:
2000

Citing 8
Cited 7

An O(EV log V) algorithm for finding a maximal weighted matching in general graphs

SIAM Journal on Computing
An algorithm for generating quantifier scopings

Computational Linguistics
Using descriptions of trees in a tree adjoining grammar

Computational Linguistics
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Constraints over Lambda-Structures in semantic underspecification

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
D-theory: talking about talking about trees

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
D-tree grammars

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Two accounts of scope availability and semantic underspecification

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on 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
The Constraint Language for Lambda Structures

Journal of Logic, Language and Information
Dominance constraints with Boolean connectives: a model-eliminative treatment

Theoretical Computer Science - Algebraic methods in language processing
Constraint Programming and Graph Algorithms

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Pure Dominance Constraints

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we identify the natural fragment of normal dominance constraints and show that its satisfiability problem is in deterministic polynomial time.