@InProceedings{Duchier_Niehren:2000,
      AUTHOR = {Duchier, Denys and Niehren, Joachim},
      TITLE = {Dominance Constraints with Set Operators},
      YEAR = {2000},
      BOOKTITLE = {1st International Conference on Computational Logic (CL '00), July 24-28},
      NUMBER = {1861},
      PAGES = {326-341},
      EDITOR = {Lloyd, J. and Dahl, V.},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Imperial College, London, UK},
      PUBLISHER = {Springer},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/dombool.ps.gz},
      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. Set operators contribute a controlled form of disjunction that is emminently well-suited for constraint propagation. We present a solver for dominance constraints with set operators as a system of abstract propagation and distribution rules, and prove its soundness and completeness. We then derive an efficient implementation in a constraint programming language with finite sets and prove its faithfullness to the abstract inference rules.},
      ANNOTE = {COLIURL : Duchier:2000:DCS.pdf Duchier:2000:DCS.ps}
}