Analyses, Optimizations and Extensions of Constraint Handling Rules: Ph.D. Summary | Zendy

Tom Schrijvers | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Analyses, Optimizations and Extensions of Constraint Handling Rules: Ph.D. Summary

Author(s) -

Tom Schrijvers

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-29208-X

DOI - 10.1007/11562931_44

Subject(s) - computer science , constraint (computer aided design) , algorithm , programming language , theoretical computer science , mathematical optimization , mathematics , geometry

This is a summary of the Ph.D. thesis of Tom Schrijvers.Constraint Handling Rules (CHR) is a rule-based languagecommonly embedded in a host language. It combines elements of Constraint Logic Programming and term rewriting. Several implementations of CHR exist: in Prolog, Haskell, Java and HAL. Typical applications of CHR are in the area of constraint solving, but currently CHR is also used in a wider range of applications, such as type checking, natural language processing and multi-agent systems.In this work we contribute program analyses, program optimizations and extensions of the CHR language.status: publishe

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research