CHR as grammar formalism. A first report

Simple item page
dc.creatorChristiansen, Henning
dc.date2001-06-29
dc.date.accessioned2026-07-25T16:29:59Z
dc.descriptionGrammars written as Constraint Handling Rules (CHR) can be executed as efficient and robust bottom-up parsers that provide a straightforward, non-backtracking treatment of ambiguity. Abduction with integrity constraints as well as other dynamic hypothesis generation techniques fit naturally into such grammars and are exemplified for anaphora resolution, coordination and text interpretation.
dc.description12 pages. Presented at ERCIM Workshop on Constraints, Prague, Czech Republic, June 18-20, 2001
dc.identifierhttps://arxiv.org/abs/cs/0106059
dc.identifierhttp://arxiv.org/abs/cs/0106059
dc.identifierProc. of ERCIM Workshop on Constraints, Prague, Czech Republic, June 18-20, 2001
dc.identifier.urihttps://dspace.dare.co.zw/handle/123456789/41875
dc.subjectProgramming Languages
dc.subjectComputation and Language
dc.subjectI.2.7;D.3.2;F.4.1;F.4.2
dc.titleCHR as grammar formalism. A first report
dc.typetext

Files

Collections

arXiv