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