An Efficient Algorithm for the Configuration Problem of Dominance Graphs

Abstract : Dominance constraints are logical tree descriptions originating from automata theory that have multiple applications in computational linguistics. The satisfiability problem of dominance constraints is NP-complete. In most applications, however, only \emphnormal dominance constraints are used. The satisfiability problem of normal dominance constraints can be reduced in linear time to the configuration problem of dominance graphs, as shown recently. In this paper, we give a polynomial time algorithm testing configurability of dominance graphs (and thus satisfiability of normal dominance constraints). Previous to our work no polynomial time algorithms were known.
Type de document :
Communication dans un congrès
Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, Washington, DC, United States. ACM Press, pp.815--824, 2001
Liste complète des métadonnées

https://hal.inria.fr/inria-00536803
Contributeur : Joachim Niehren <>
Soumis le : mardi 16 novembre 2010 - 23:09:16
Dernière modification le : lundi 20 novembre 2017 - 15:14:01
Document(s) archivé(s) le : jeudi 17 février 2011 - 03:13:33

Fichiers

dom-graph.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00536803, version 1

Citation

Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, et al.. An Efficient Algorithm for the Configuration Problem of Dominance Graphs. Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, Washington, DC, United States. ACM Press, pp.815--824, 2001. 〈inria-00536803〉

Partager

Métriques

Consultations de la notice

65

Téléchargements de fichiers

57