Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities
-
Published:2009-02-10
Issue:02
Volume:9
Page:165-212
-
ISSN:1471-0684
-
Container-title:Theory and Practice of Logic Programming
-
language:en
-
Short-container-title:Theory and Practice of Logic Programming
Author:
DE KONINCK LESLIE
Abstract
AbstractThis paper investigates the relationship between the Logical Algorithms (LA) language of Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation schema from LA to CHRrp: CHR with rule priorities, and show that the meta-complexity theorem for LA can be applied to a subset of CHRrpvia 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 CHRrpthat gives strong complexity guarantees and results in a new and accurate meta-complexity theorem for CHRrp. It is furthermore shown that the translation from Logical Algorithms to CHRrpcombined with the new CHRrpimplementation satisfies the required complexity for the Logical Algorithms meta-complexity result to hold.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Constraint Handling Rules - What Else?;Rule Technologies: Foundations, Tools, and Applications;2015
2. A complete and terminating execution model for Constraint Handling Rules;Theory and Practice of Logic Programming;2010-07