An efficient graph algorithm for dominance constraints

Authors:
Ernst Althaus;Denys Duchier;Alexander Koller;Kurt Mehlhorn;Joachim Niehren;Sven Thiel
Affiliations:
Max-Planck-Institute for Computer Science, Saarbrücken, Germany;Programming Systems Lab, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, Germany;Department of Computational Linguistics, Universitat des Saarlandes, Saarbrücken, Germany;Max-Planck-Institute for Computer Science, Saarbrücken, Germany;Programming Systems Lab, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, Germany;Max-Planck-Institute for Computer Science, Saarbrücken, Germany
Venue:
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Year:
2003

Citing 17
Cited 16

An improved algorithm for transitive closure on acyclic digraphs

Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Feature-constraint logics for unification grammars

Journal of Logic Programming
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
An efficient algorithm for the configuration problem of dominance graphs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Unique maximum matching algorithms

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Ordering Constraints over Feature Trees

Constraints
The Constraint Language for Lambda Structures

Journal of Logic, Language and Information
Constraints over Lambda-Structures in semantic underspecification

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
An improper treatment of quantification in ordinary English

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
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
On determining the consistency of partial descriptions of trees

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Monotonic semantic interpretation

ACL '92 Proceedings of the 30th 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
A polynomial-time fragment of dominance constraints

ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics

A new algorithm for normal dominance constraints

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Well-nested parallelism constraints for ellipsis resolution

EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Bridging the gap between underspecification formalisms: hole semantics as dominance constraints

EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Bridging the gap between underspecification formalisms: minimal recursion semantics as dominance constraints

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Minimal recursion semantics as dominance constraints: translation, evaluation, and analysis

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
An improved redundancy elimination algorithm for underspecified representations

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Efficient solving and exploration of scope ambiguities

ACLdemo '05 Proceedings of the ACL 2005 on Interactive poster and demonstration sessions
Efficient processing of underspecified discourse representations

HLT-Short '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers
A logic of semantic representations for shallow parsing

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
The evolution of dominance constraint solvers

Software '05 Proceedings of the Workshop on Software
Constraint-based computational semantics: a comparison between LTAG and LRS

TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Computing weakest readings

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
On the computational complexity of dominance links in grammatical formalisms

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
An efficient enumeration algorithm for canonical form underspecified semantic representations

FG'09 Proceedings of the 14th international conference on Formal grammar
The tree constraint

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Expanding the range of tractable scope-underspecified semantic representations

SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation

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 normal dominance constraints and present an efficient graph algorithm for testing their satisfiability in deterministic polynomial time. Previously, no polynomial time algorithm was known.