Skip to main content
SpringerLink
Log in

Logical Grammars Based on Constraint Handling Rules

  • Conference paper
  • First Online:
Logic Programming (ICLP 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2401))

Included in the following conference series:

Abstract

CHR Grammars (CHRGs) are a grammar formalism that provides a constraint-solving approach to language analysis, built on top of Constraint Handling Rules in the same way as Definite Clause Grammars (DCGs) on Prolog. CHRGs work bottom-up and add the following features when compared with DCGs:

  • An inherent treatment of ambiguity without backtracking.

  • Robust parsing; do not give up in case of errors but return the recognized phrases.

  • Flexibility to produce and consume arbitrary hypotheses making it straightforward to deal with abduction, integrity constraints, operators á la assumption grammars, and to incorporate other constraint solvers.

  • References to left and right syntactic context; apply for disambiguation of simple and otherwise ambiguous grammars, coordination in natural language, and tagger-like grammar rules.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Christiansen, H., Abductive language interpretation as bottom-up deduction. To appear in: Wintner, S. (ed.), Proc. of NLULP 2002, Natural Language Understanding and Logic Programming, Copenhagen, Denmark, July 28th, 2002.

    Google Scholar 

  2. Web site for CHRG with source code written in SICStus Prolog, Users’ Guide, sample grammars, and full version of the present paper: http://www.ruc.dk/~henning/chrg/

Download references

Author information

Authors and Affiliations

  1. Computer Science Dept., Roskilde University, P.O.Box 260, DK-4000, Roskilde, Denmark

    Henning Christiansen

Authors
  1. Henning Christiansen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Software Engineering, University of Melbourne, 221 Bouverie St., Carlton, 3053, Australia

    Peter J. Stuckey

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Christiansen, H. (2002). Logical Grammars Based on Constraint Handling Rules. In: Stuckey, P.J. (eds) Logic Programming. ICLP 2002. Lecture Notes in Computer Science, vol 2401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45619-8_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-45619-8_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43930-1

  • Online ISBN: 978-3-540-45619-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation