Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-19T09:43:43.804Z Has data issue: false hasContentIssue false
  • English
  • Français

Introduction to the Special Issue on Constraint Handling Rules

Published online by Cambridge University Press:  01 July 2005

SLIM ABDENNADHER ,
THOM FRÜHWIRTH  and
CHRISTIAN HOLZBAUR
SLIM ABDENNADHER
Affiliation:
Department of Computer Science, German University Cairo, Egypt (e-mail: [email protected])
THOM FRÜHWIRTH
Affiliation:
Faculty of Computer Science, University of Ulm, Germany (e-mail: www.informatik.uni-ulm.de/pm/mitarbeiter/fruehwirth/)
CHRISTIAN HOLZBAUR
Affiliation:
(e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Extract

During the last decade, Constraint Handling Rules (CHR) have become a major specification and implementation language for logical, constraint-based algorithms and intelligent applications (as witnessed for example by several hundred publications available online that mention CHR). Algorithms are often specified using inference rules, rewrite rules, sequents, proof rules, or logical axioms that can be almost directly written in CHR.

Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 5 , Issue 4-5 , July 2005 , pp. 401 - 402
Copyright
© 2005 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)