A Polynomial-Time Fragment of Dominance Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

A Polynomial-Time Fragment of Dominance Constraints


Dominance constraints are a logical language for describing trees that is widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we identify emphnormal dominance constraints, a natural fragment whose satisfiability problem we show to be in polynomial time. We present a quadratic satisfiability algorithm and use it in another algorithm that enumerates solutions efficiently. Our result is useful for various applications of dominance constraints and related formalisms.
Fichier principal
Vignette du fichier
poly-dom.pdf (146.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00536809 , version 1 (16-11-2010)


  • HAL Id : inria-00536809 , version 1


Alexander Koller, Kurt Mehlhorn, Joachim Niehren. A Polynomial-Time Fragment of Dominance Constraints. 38th Annual Meeting of the Association of Computational Linguistics, 2000, Hong Kong, China. pp.368--375. ⟨inria-00536809⟩
34 View
140 Download


Gmail Facebook Twitter LinkedIn More