Title: The correspondence between the logical algorithms language and CHR
Authors: De Koninck, Leslie ×
Schrijvers, Tom
Demoen, Bart #
Issue Date: 2007
Publisher: Springer
Host Document: Lecture Notes in Computer Science vol:4670 pages:209-223
Conference: International Conference on Logic Programming edition:23 location:Porto, Portugal date:September 8-13, 2007
Abstract: This paper investigates the relationship between the Logical Algorithms language (LA) of Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation scheme from LA to CHR-rp: CHR with rule priorities and show that the meta-complexity theorem for LA can be applied to a subset of CHR-rp via inverse translation. This result is compared with previous work. Inspired by the high-level implementation proposal of Ganzinger and McAllester, we demonstrate how LA programs can be compiled into CHR rules that interact with a scheduler written in CHR. This forms the first actual implementation of LA. Our implementation achieves the complexity required for the meta-complexity theorem to hold and can execute a subset of CHR-rp with strong complexity bounds.
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 Status SizeFormat
paper.pdf Published 198KbAdobe PDFView/Open


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

© Web of science