Title: Cadmium: An implementation of ACD term rewriting
Authors: Duck, Gregory J. ×
De Koninck, Leslie
Stuckey, Peter J. #
Issue Date: 2008
Publisher: Springer
Host Document: Lecture notes in computer science vol:5366 pages:531-545
Conference: International Conference on Logic Programming edition:24 location:Udine, Italy date:9-12 December 2008
Abstract: Cadmium is a rule based programming language for compiling solver independent constraint models to various solver dependent back-ends. Cadmium is based on a hybrid between
Constraint Handling Rules (CHR) and term rewriting modulo Associativity, Commutativity and a restricted form of Distributivity (ACD) called Conjunctive Context (CC).
Experience with using Cadmium in the G12 project shows that CC is a powerful language feature, as local model mapping can depend on some non-local context, such as variable declarations or other constraints. However, CC significantly complicates the Cadmium normalisation algorithm, since the normal form of a term may depend on what context it appears in. In this paper we present an implementation of Cadmium based on classic bottom-up evaluation, but modified to handle CC matching. We evaluate the performance of the new implementation compared to earlier prototype normalisation algorithms. We show that the resulting system is fast enough to run "real-world" Cadmium applications.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
cd_impl.pdf Published 182KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science