A new algorithm for normal dominance constraints

Authors:
Manuel Bodirsky;Denys Duchier;Joachim Niehren;Sebastian Miele
Affiliations:
Humboldt Universitát zu Berlin, Germany;LORIA, Nancy, France;INRIA team Mostrare, Université de Lille, France;Universität des Saarlandes, Germany
Venue:
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2004

Citing 6
Cited 8

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The Constraint Language for Lambda Structures

Journal of Logic, Language and Information
Pure Dominance Constraints

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
D-theory: talking about talking about trees

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
An efficient graph algorithm for dominance constraints

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
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

Conjunctive queries over trees

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Conjunctive queries over trees

Journal of the ACM (JACM)
Minimal recursion semantics as dominance constraints: translation, evaluation, and analysis

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Dominance constraints in stratified context unification

Information Processing Letters
Efficient solving and exploration of scope ambiguities

ACLdemo '05 Proceedings of the ACL 2005 on Interactive poster and demonstration sessions
Combining Tree Partitioning, Precedence, and Incomparability Constraints

Constraints
The evolution of dominance constraint solvers

Software '05 Proceedings of the Workshop on Software
Well-nested context unification

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dominance constraints are logical descriptions of trees. Efficient algorithms for the subclass of normal dominance constraints were recently proposed. We present a new and simpler graph algorithm solving these constraints more efficiently, in quadratic time per solved form. It also applies to weakly normal dominance constraints as needed for an application to computational linguistics. Subquadratic running time can be achieved employing decremental graph biconnectivity algorithms.