@book{Sterling:1986,
  added-at = {2007-12-14T02:46:58.000+0100},
  address = {Cambridge (MA)},
  author = {Sterling, Leon and Shapiro, Ehud},
  biburl = {http://www.bibsonomy.org/bibtex/2321eebc10b64430a02ec974bec126056/diego_ma},
  interhash = {da3799615a0ab69b57bf66ce3de47d5d},
  intrahash = {321eebc10b64430a02ec974bec126056},
  keywords = {prolog},
  publisher = {MIT Press},
  timestamp = {2007-12-14T02:46:58.000+0100},
  title = {The Art of Prolog},
  year = 1986
}

@book{Shoham:1994,
  added-at = {2007-12-14T02:46:35.000+0100},
  author = {Shoham, Yoav},
  biburl = {http://www.bibsonomy.org/bibtex/23f6c6fb15da8730224d50c6321a2aa89/diego_ma},
  interhash = {067986eb61c73fdfea9debc5fd3a5680},
  intrahash = {3f6c6fb15da8730224d50c6321a2aa89},
  keywords = {AI prolog},
  publisher = {Morgan Kaufmann},
  timestamp = {2007-12-14T02:46:35.000+0100},
  title = {Artificial Intelligence Techniques in Prolog},
  year = 1994
}

@incollection{Morawietz:2002,
  abstract = {In this paper, parsing as deduction and constraint programming are brought together to outline a procedure for the specification of constraint-based (chart) parsers. Extending the proposal in Shieber (1995) which provides a meta interpreter for several deduction systems, we show how to directly realize the inference rules for chart parsers as Constraint Handling Rules ({Fr\"{u}hwirth}, 1998) by viewing the items of a conventional chart parser as constraints and the constraint base as a chart. This allows the direct use of the constraint resolution process to parse sentences in diverse natural language formalisms such as minimalist grammars (Stabler, 1997; Stabler, 2001) or property grammars (Blache, 2000; Balfourier et al., 2002).},
  added-at = {2007-12-14T02:44:13.000+0100},
  author = {Morawietz, Frank and Blache, Philippe},
  biburl = {http://www.bibsonomy.org/bibtex/2348569bda05ddec27946b010eaf281a2/diego_ma},
  booktitle = {Theory and Practice of Logic Programming},
  interhash = {e73e8ff57d9e960b6c29027699fdfadd},
  intrahash = {348569bda05ddec27946b010eaf281a2},
  keywords = {costraint_programming robust_parsing prolog property_grammar},
  timestamp = {2007-12-14T02:44:13.000+0100},
  title = {Parsing Natural Languages with {CHR}},
  url = {http://tcl.sfs.uni-tuebingen.de/\~{}frank/papers/abstracts/tplp.html},
  year = {Submitted}
}

@book{Gazdar:1989,
  added-at = {2007-12-14T02:39:20.000+0100},
  address = {Wokingham, England},
  author = {Gazdar, Gerald and Mellish, Chris},
  biburl = {http://www.bibsonomy.org/bibtex/2c2632cb27145293b48c535189bf2bde1/diego_ma},
  interhash = {b257083cc44a135a1659ef849ab79a26},
  intrahash = {c2632cb27145293b48c535189bf2bde1},
  keywords = {NLP prolog},
  publisher = {Addison-Wesley},
  timestamp = {2007-12-14T02:39:20.000+0100},
  title = {Natural Language Processing in {PROLOG}},
  year = 1989
}

@techreport{Covington:1994:3,
  added-at = {2007-12-14T02:37:46.000+0100},
  author = {Covington, Michael A.},
  biburl = {http://www.bibsonomy.org/bibtex/26bc9bb8718cb309bbffb3ae720d3a221/diego_ma},
  institution = {Artificial Intelligence Center, The University of Georgia},
  interhash = {cff80ac73eacb977eff05284de7dfa40},
  intrahash = {6bc9bb8718cb309bbffb3ae720d3a221},
  keywords = {NLP grammar prolog},
  number = {AI-1994-06},
  timestamp = {2007-12-14T02:37:46.000+0100},
  title = {{GULP} 3.1: An Extension of Prolog for Unification-Based Grammar},
  url = {http://www.ai.uga.edu/\~{}mc/},
  year = 1994
}

@book{Covington:1994:2,
  added-at = {2007-12-14T02:37:45.000+0100},
  address = {Englewood Cliffs, NJ},
  author = {Covington, Michael A.},
  biburl = {http://www.bibsonomy.org/bibtex/213795b7223508e1b7c2f20f1761c4979/diego_ma},
  interhash = {0d87cea2c08999865a40f7b120a50902},
  intrahash = {13795b7223508e1b7c2f20f1761c4979},
  keywords = {NLP prolog},
  publisher = {Prentice-Hall},
  timestamp = {2007-12-14T02:37:45.000+0100},
  title = {Natural Language Processing for Prolog Programmers},
  year = 1994
}

@article{Covington:forth,
  added-at = {2007-12-14T02:37:44.000+0100},
  author = {Covington, Michael A.},
  biburl = {http://www.bibsonomy.org/bibtex/2b7592fe7dbc46b164f291b4f337f32ce/diego_ma},
  interhash = {f0c3b33a462151528153d916bf957e51},
  intrahash = {b7592fe7dbc46b164f291b4f337f32ce},
  journal = {Applied Artificial Intelligence},
  keywords = {plural logic_programming prolog},
  timestamp = {2007-12-14T02:37:44.000+0100},
  title = {Natural Language Plurals in Logic Programming Queries},
  year = {forthcoming}
}

@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
}

@inproceedings{Balder:2002,
  abstract = {We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tableau theorem proving. The algorithm relies on a syntactic characterization of answerhood: Any answer to a question is equivalent to some formula built up only from instances of the question. We prove this characterization by translating the logic of interrogation to classical predicate logic and applying Craig's interpolation theorem.},
  added-at = {2007-12-14T02:37:17.000+0100},
  author = {ten Cate, Balder and chieh Shan, Chung},
  biburl = {http://www.bibsonomy.org/bibtex/27bc1e7d4b370103c868c43fcc90face7/diego_ma},
  booktitle = {Proc. TABLEAUX 2002},
  editor = {Egly, Uwe and Fermueller, Christian G.},
  interhash = {90d6484676cf6327f8fd2dbbe37f666a},
  intrahash = {7bc1e7d4b370103c868c43fcc90face7},
  keywords = {semantics questions prolog},
  note = {Also in Proc. NLULP 2002},
  pages = {251-265},
  series = {Lecture Notes in Artificial Intelligence 2381},
  timestamp = {2007-12-14T02:37:17.000+0100},
  title = {Question Answering: From Partitions to Prolog},
  url = {http://arxiv.org/abs/cs.CL/0209009},
  year = 2002
}

@misc{Carpenter:1999,
  abstract = {This document describes how Prolog can be used as part of the Common Gateway Interface (CGI) [for more information on CGI, check out the University of Kansas CGI Intro or the NCSA CGI Intro] in order to process HTML Forms. As an example, we use the Type-Logical Grammar Theorem Prover.},
  added-at = {2007-12-14T02:37:07.000+0100},
  author = {Carpenter, Bob},
  biburl = {http://www.bibsonomy.org/bibtex/264b801ff855d0a3a3b6efdb9c174114a/diego_ma},
  interhash = {a16c0cf5073e1077b77c9a869c1615ca},
  intrahash = {64b801ff855d0a3a3b6efdb9c174114a},
  keywords = {prolog computer},
  note = {On-line publication},
  timestamp = {2007-12-14T02:37:07.000+0100},
  title = {A Prolog {CGI} Interface},
  url = {http://www.colloquial.com/tlg/cgi.html},
  year = 1999
}