Our seminar series is free and available for anyone to attend. Unless otherwise stated, seminars take place on Wednesday afternoons at 2pm in the Kilburn Building during teaching season.

If you wish to propose a seminar speaker please contact Antoniu Pop.


Constraint Handling Rules

  • Speaker:   Prof  Thom Fruehwirth  (University of Ulm, Germany)
  • Host:   Andrei Voronkov
  • 5th May 2010 at 14:00 in Lecture Theatre 1.4, Kilburn Building
Rule-based programming experiences renaissance due to its applications in areas such as Business Rules, Semantic Web, Computational Biology, Verification and Security.

Constraint Handling Rules (CHR) is a concurrent committed-choice constraint logic programming language consisting of guarded rules that transform multi-sets of atomic formulas (constraints) until exhaustion. CHR has matured into an efficient general-purpose concurrent constraint language over the last decade, because it can embed many rule-based formalisms and systems, and it can describe algorithms in a compact declarative way. The clean semantics of CHR ensures that several desirable properties hold for CHR programs and also facilitates non-trivial program analysis. Last but not least, we present typical academic and commercial applications involving CHR.
▲ Up to the top