Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities

Simple item page
dc.creatorDe Koninck, Leslie
dc.date2009-01-09
dc.date.accessioned2026-07-07T12:28:02Z
dc.date.available2026-07-07T12:28:02Z
dc.descriptionThis paper investigates the relationship between the Logical Algorithms language (LA) of Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation schema 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. Inspired by the high-level implementation proposal for Logical Algorithm by Ganzinger and McAllester and based on a new scheduling algorithm, we propose an alternative implementation for CHR-rp that gives strong complexity guarantees and results in a new and accurate meta-complexity theorem for CHR-rp. It is furthermore shown that the translation from Logical Algorithms to CHR-rp combined with the new CHR-rp implementation, satisfies the required complexity for the Logical Algorithms meta-complexity result to hold.
dc.descriptionTo appear in Theory and Practice of Logic Programming (TPLP)
dc.identifierhttps://arxiv.org/abs/0901.1230
dc.identifierhttp://arxiv.org/abs/0901.1230
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/215407
dc.subjectProgramming Languages
dc.subjectArtificial Intelligence
dc.subjectComputational Complexity
dc.titleLogical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities
dc.typetext

Files

Collections

arXiv