@inproceedings{Pullum:2001,
  abstract = {Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generativeenumerative syntax (GES)an d model-theoretic syntax (MTS). They are based on very different mathematics. GES developed in the 1950s out of Post's work on the syntactic side of logic. MTS arose somewhat later out of the semantic side of logic. We identify some distinguishing theoretical features of these frameworks, relating to cardinality of the set of expressions, size of individual expressions, and �transderivational constraints�. We then turn to three kinds of linguistic phenomena: partial grammaticality, the syntactic properties of expression fragments, and the fact that the lexicon of any natural language is in constant flux, and conclude that MTS has some major advantages for linguistic description that have been overlooked. We briefly consider the issue of what natural languages in MTS terms, and touch on implications for parsing and acquisition.},
  added-at = {2007-12-14T02:45:19.000+0100},
  address = {Berlin Heidelberg},
  author = {Pullum, Geoffrey K. and Scholz, Barbara C.},
  biburl = {http://www.bibsonomy.org/bibtex/265ccc6bfaeeea105f9a76256b35ad221/diego_ma},
  booktitle = {Proceedings LACL 2001},
  editor = {de Groote, Philippe and Morrill, Glyn and Retor{\'e}, Christian},
  interhash = {00b7e58cd97ed1360245cce4f967ef47},
  intrahash = {65ccc6bfaeeea105f9a76256b35ad221},
  keywords = {grammar constraint_programming},
  pages = {17-43},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Artificial Intelligence},
  timestamp = {2007-12-14T02:45:19.000+0100},
  title = {On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks},
  url = {http://www.informatik.uni-trier.de/~ley/db/conf/lacl/lacl2001.html#PullumS01},
  year = 2001
}

@inproceedings{Maruyama:1990,
  added-at = {2007-12-14T02:43:03.000+0100},
  author = {Maruyama, Hiroshi},
  biburl = {http://www.bibsonomy.org/bibtex/2b950852f8d39f29c19fe3ea6f22f1b70/diego_ma},
  booktitle = {Proceedings of the 28th conference on Association for Computational Linguistics},
  interhash = {0cae56e88b1def96a8b8f3967561418a},
  intrahash = {b950852f8d39f29c19fe3ea6f22f1b70},
  keywords = {constraint_programming underspecification},
  pages = {31--38},
  publisher = {Association for Computational Linguistics},
  timestamp = {2007-12-14T02:43:03.000+0100},
  title = {Structural disambiguation with constraint propagation},
  url = {http://portal.acm.org/citation.cfm?id=981828#},
  year = 1990
}

@inproceedings{Koller:1999,
  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 combinatoric 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.},
  added-at = {2007-12-14T02:41:42.000+0100},
  author = {Koller, Alexander and Niehren, Joachim},
  biburl = {http://www.bibsonomy.org/bibtex/274a0d051119096eadc7c6ccda5f80e8a/diego_ma},
  booktitle = {Proc. LLC8},
  editor = {Beaver, David and van Benthem, Johan and di Luzio, P. Scotto},
  interhash = {e739dcb18e3df0fab94df120536391e7},
  intrahash = {74a0d051119096eadc7c6ccda5f80e8a},
  keywords = {underspecification constraint_programming DG},
  publisher = {CSLI},
  timestamp = {2007-12-14T02:41:42.000+0100},
  title = {Constraint Programming Technology in Computational Linguistics},
  url = {http://www.coli.uni-sb.de/~koller/papers/cpcl.html},
  year = 1999
}

@article{Fruehwirth:1998,
  abstract = {Constraing Handling Rules (CHR) are our proposal to allow more flexibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-defined constraints...},
  added-at = {2007-12-14T02:39:05.000+0100},
  author = {Fr{\"u}hwirth, Thom},
  biburl = {http://www.bibsonomy.org/bibtex/2f75357a26a05742bbde10319b5144c6d/diego_ma},
  interhash = {4a1cff7c86eee0b1e64e3f265389c809},
  intrahash = {f75357a26a05742bbde10319b5144c6d},
  journal = {The Journal of Logic Programming},
  keywords = {constraint_programming},
  number = {1-3},
  pages = {95-138},
  timestamp = {2007-12-14T02:39:05.000+0100},
  title = {Theory and Practice of Constraint Handling Rules},
  volume = 37,
  year = 1994
}

@misc{Christiansen:2002b,
  abstract = {This document explains how to use CHRG which is a grammar notation implemented on top of the CHR language of Constraint Handling Rules. CHR is an extension to Prolog with committed choice multiple-headed rules. You need to have a recent version of SICSTUS Prolog installed on your computer that supports the CHR library.},
  added-at = {2007-12-14T02:37:23.000+0100},
  author = {Christiansen, Henning},
  biburl = {http://www.bibsonomy.org/bibtex/28ff465d7bd9b7c9df5a943dff1d42124/diego_ma},
  howpublished = {\myurl{http://www.dat.ruc.dk/\~{}henning/chrg/CHRGusersGuide.html}},
  interhash = {b8da5359a987505b4d814e56b244bc61},
  intrahash = {8ff465d7bd9b7c9df5a943dff1d42124},
  keywords = {constraint_programming grammar prolog},
  month = {November},
  note = {Visited 28 August 2003},
  timestamp = {2007-12-14T02:37:23.000+0100},
  title = {User's Guide to CHR Grammars},
  url = {http://www.dat.ruc.dk/\~{}henning/chrg/CHRGusersGuide.html},
  year = 2002
}

@unpublished{Christiansen:2002,
  abstract = {A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena...},
  added-at = {2007-12-14T02:37:22.000+0100},
  author = {Christiansen, Henning},
  biburl = {http://www.bibsonomy.org/bibtex/24a87de8a3f726dec9e1dba751477ece3/diego_ma},
  interhash = {3ac3671a0f162438a717a822033d9b7b},
  intrahash = {4a87de8a3f726dec9e1dba751477ece3},
  keywords = {constraint_programming grammar prolog},
  note = {Submitted to journal Theory and Practice of Logic Programming},
  timestamp = {2007-12-14T02:37:22.000+0100},
  title = {CHR Grammmars},
  url = {http://www.dat.ruc.dk/~henning/chrg/PapersOnCHRG/index.html},
  year = 2002
}

@incollection{Blache:2000,
  abstract = {The notion of constraints is generally used in modern linguistics (in particular in syntax and phonology) for representing properties the an object must satisfy. Constraints can be general (or universal), valid for different languages, or at the opposite very specific, representing for example the variability of a given language. In all cases, the idea consists of stipulating properties ruling out structures which don't belong to the language...},
  added-at = {2007-12-14T02:36:08.000+0100},
  author = {Blache, Philippe},
  biburl = {http://www.bibsonomy.org/bibtex/2bdf5fc52cfaafa710ed3c58f744c1063/diego_ma},
  booktitle = {Natural Language Processing},
  editor = {Christodoulakis, D.},
  interhash = {9d81751f96a6133894c88798d02bca86},
  intrahash = {bdf5fc52cfaafa710ed3c58f744c1063},
  keywords = {constraint_programming property_grammar},
  publisher = {Springer Verlag},
  series = {Lecture Notes in Artificial Intelligence},
  timestamp = {2007-12-14T02:36:08.000+0100},
  title = {Constraints, Linguistic Theories and Natural Language Processing},
  url = {http://www.lpl.univ-aix.fr/~blache/publis.html},
  year = 2000
}