Workshop on Declarative Programming with Sets (DPS'99), pp. 91--98, September 1999
We describe our application of set constraints to the problem of finding solutions of tree descriptions. The encoding that turns a
description into a CSP is given here in full in an axiomatic style.
@INPROCEEDINGS{duchier:wdps99,
title = {Set Constraints in Computational Linguistics -- Solving Tree Descriptions},
author = {Denys Duchier},
year = {1999},
month = {sep},
booktitle = {Workshop on Declarative Programming with Sets (DPS'99)},
pages = {{91--98}},
}
