Computer Science – Programming Languages
Scientific paper
2001-06-29
Proc. of ERCIM Workshop on Constraints, Prague, Czech Republic, June 18-20, 2001
Computer Science
Programming Languages
12 pages. Presented at ERCIM Workshop on Constraints, Prague, Czech Republic, June 18-20, 2001
Scientific paper
Grammars 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.
No associations
LandOfFree
CHR as grammar formalism. A first report does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with CHR as grammar formalism. A first report, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and CHR as grammar formalism. A first report will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-331431