@InCollection{Koller_Niehren:2002,
AUTHOR = {Koller, Alexander and Niehren, Joachim},
TITLE = {Constraint Programming in Computational Linguistics},
YEAR = {2002},
BOOKTITLE = {Words, Proofs, and Diagrams},
EDITOR = {Barker-Plummer, Dave and Beaver, David I. and van Benthem, Johan and di Luzio, Patrick Scotto},
ADDRESS = {Stanford},
PUBLISHER = {CSLI Press},
URL = {http://www.ps.uni-sb.de/Papers/abstracts/CP-NL.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/CP-NL.ps.gz},
ABSTRACT = {Constraint programming is a programming paradigm that was originally invented in computer science to deal with hard combinatorial problems. Recently, constraint programming has evolved into a technology which permits to solve hard industrial scheduling and optimization problems. We argue that existing constraint programming technology can be useful for applications in natural language processing. Some problems whose treatment with traditional methods requires great care to avoid combinatorial explosion of (potential) readings seem to be solvable in an efficient and elegant manner using constraint programming. We illustrate our claim by two recent examples, one from the area of underspecified semantics and one from parsing.},
NOTE = {Extended version of a paper at the 8th Stanford Workshop on Logic, Language, and Computation (1999)},
ANNOTE = {COLIURL : Koller:2002:CPC.pdf Koller:2002:CPC.ps}
}
|
