Dominance Constraints with Set Operators (2000)
by
Denys Duchier
,
Joachim Niehren
| Venue: | In Proceedings of the First International Conference on Computational Logic (CL2000), LNCS |
| Citations: | 19 - 15 self |
BibTeX
@INPROCEEDINGS{Duchier00dominanceconstraints,
author = {Denys Duchier and Joachim Niehren},
title = {Dominance Constraints with Set Operators},
booktitle = {In Proceedings of the First International Conference on Computational Logic (CL2000), LNCS},
year = {2000},
pages = {326--341},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by admitting set operators. We present a solver for dominance constraints with set operators, which is based on propagation and distribution rules, and prove its soundness and completeness.
