Dominance Constraints: Algorithms and Complexity

@inproceedings{Koller1998DominanceCA,
  title={Dominance Constraints: Algorithms and Complexity},
  author={Alexander Koller and Joachim Niehren and Ralf Treinen},
  booktitle={LACL},
  year={1998}
}
Dominance constraints for nite tree structures are widely used in several areas of computational linguistics including syntax, semantics, and discourse. In this paper, we investigate algorithmic and complexity questions for dominance constraints and their rst-order theory. We present two NP algorithms for solving dominance constraints, which have been implemented in the concurrent constraint programming language Oz. The main result of this paper is that the satissability problem of dominance… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
42 Extracted Citations
11 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.

Similar Papers

Loading similar papers…