K.U.Leuven JCHR: a user-friendly, flexible and efficient CHR system for Java (2005)
Cached
Download Links
| Venue: | IN PROC. 2ND WORKSHOP ON CONSTRAINT HANDLING RULES (CHR’05 |
| Citations: | 19 - 14 self |
BibTeX
@INPROCEEDINGS{Weert05k.u.leuvenjchr:,
author = {Peter Van Weert and Tom Schrijvers and Bart Demoen},
title = {K.U.Leuven JCHR: a user-friendly, flexible and efficient CHR system for Java},
booktitle = {IN PROC. 2ND WORKSHOP ON CONSTRAINT HANDLING RULES (CHR’05},
year = {2005},
pages = {47--62},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A new integration of Constraint Handling Rules (CHR) and Java is presented: the K.U.Leuven JCHR system. It was designed with three aims in mind: user-friendliness, flexibility and efficiency. User-friendliness is achieved by providing a high-level syntax that feels familiar to both Java programmers and users of other CHR embeddings, and by full compliance to the refined operational semantics. Flexibility is the result of a well thought-out design, allowing e.g. an easy integration of built-in constraint solvers and variable types. Efficiency is achieved through an optimized compilation to Java and the use of a very efficient constraint store. The design of the K.U.Leuven JCHR system is presented, its implementation discussed and its performance is compared with other CHR systems embedded in Java and Prolog.
