Cadmium: An implementation of ACD term rewriting

Gregory J. Duck; Leslie De Koninck; Peter J. Stuckey

doi:10.1007/978-3-540-89982-2_45

Cadmium: An implementation of ACD term rewriting

Gregory J. Duck, Leslie De Koninck, Peter J. Stuckey

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

13 Citations (Scopus)

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.

Original language	English
Title of host publication	Logic Programming - 24th International Conference, ICLP 2008, Proceedings
Pages	531-545
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-540-89982-2_45
Publication status	Published - 1 Dec 2008
Externally published	Yes
Event	International Conference on Logic Programming 2008 - Udine, Italy Duration: 9 Dec 2008 → 13 Dec 2008 Conference number: 24th https://link.springer.com/book/10.1007/978-3-540-89982-2 (Proceedings)

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5366 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	International Conference on Logic Programming 2008
Abbreviated title	ICLP 2008
Country/Territory	Italy
City	Udine
Period	9/12/08 → 13/12/08
Internet address	https://link.springer.com/book/10.1007/978-3-540-89982-2 (Proceedings)

Access to Document

10.1007/978-3-540-89982-2_45

Cite this

Duck, G. J., De Koninck, L., & Stuckey, P. J. (2008). Cadmium: An implementation of ACD term rewriting. In Logic Programming - 24th International Conference, ICLP 2008, Proceedings (pp. 531-545). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5366 LNCS). https://doi.org/10.1007/978-3-540-89982-2_45

@inproceedings{8b2d7ddead8d4e6d8c97f5cb9310cf5a,

title = "Cadmium: An implementation of ACD term rewriting",

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.",

author = "Duck, {Gregory J.} and {De Koninck}, Leslie and Stuckey, {Peter J.}",

year = "2008",

month = dec,

day = "1",

doi = "10.1007/978-3-540-89982-2_45",

language = "English",

isbn = "3540899812",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "531--545",

booktitle = "Logic Programming - 24th International Conference, ICLP 2008, Proceedings",

note = "International Conference on Logic Programming 2008, ICLP 2008 ; Conference date: 09-12-2008 Through 13-12-2008",

url = "https://link.springer.com/book/10.1007/978-3-540-89982-2",

}

Duck, GJ, De Koninck, L & Stuckey, PJ 2008, Cadmium: An implementation of ACD term rewriting. in Logic Programming - 24th International Conference, ICLP 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5366 LNCS, pp. 531-545, International Conference on Logic Programming 2008, Udine, Italy, 9/12/08. https://doi.org/10.1007/978-3-540-89982-2_45

Cadmium: An implementation of ACD term rewriting. / Duck, Gregory J.; De Koninck, Leslie; Stuckey, Peter J.
Logic Programming - 24th International Conference, ICLP 2008, Proceedings. 2008. p. 531-545 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5366 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Cadmium

T2 - International Conference on Logic Programming 2008

AU - Duck, Gregory J.

AU - De Koninck, Leslie

AU - Stuckey, Peter J.

N1 - Conference code: 24th

PY - 2008/12/1

Y1 - 2008/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=58549111117&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-89982-2_45

DO - 10.1007/978-3-540-89982-2_45

M3 - Conference Paper

AN - SCOPUS:58549111117

SN - 3540899812

SN - 9783540899815

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 531

EP - 545

BT - Logic Programming - 24th International Conference, ICLP 2008, Proceedings

Y2 - 9 December 2008 through 13 December 2008

ER -

Cadmium: An implementation of ACD term rewriting

Abstract

Publication series

Conference

Access to Document

Other files and links

Cite this