## The Correspondence between the Logical Algorithms Language and CHR (2007)

### Cached

### Download Links

- [www.cs.kuleuven.ac.be]
- [www.cs.kuleuven.be]
- [www.cs.kuleuven.be]
- DBLP

### Other Repositories/Bibliography

Citations: | 6 - 5 self |

### BibTeX

@MISC{Koninck07thecorrespondence,

author = {Leslie De Koninck and Tom Schrijvers and Bart Demoen},

title = {The Correspondence between the Logical Algorithms Language and CHR},

year = {2007}

}

### OpenURL

### Abstract

This paper investigates the relationship between the Logical Algorithms formalism (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 metacomplexity 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 required complexity for the meta-complexity theorem to hold and can execute a subset of CHR rp with strong complexity bounds.

### Citations

586 |
L.: Rete: A fast algorithm for the many pattern/many object pattern match problem
- Forgy
- 1982
(Show Context)
Citation Context ...g as host language, but the implementation can easily be adapted to work with other host languages. 5.1 Overview The implementation is based on a form of eager matching, similar to the RETE algorithm =-=[3]-=-. Partial matches (called prefix instances in [9]) are stored and extended by new assertions. Full matches (rule instances) are inserted in a globalspriority queue and the highest priority rule instan... |

575 |
Fibonacci heaps and their uses in improved network optimization algorithms
- Fredman, Tarjan
- 1984
(Show Context)
Citation Context ...sts the use of two types of priority queues, one for the fixed priorities, where each of the supported operations takes constant time, and a Fibonacci heap for the dynamic priorities. Fibonacci heaps =-=[4]-=- are a type of priority queue that offer O(1) amortized time insertion, heap merging and finding a highest priority item, and O(log n) amortized time item removal with n the number of items in the que... |

396 | Theory and practice of constraint handling rules
- Frühwirth
- 1998
(Show Context)
Citation Context ...implementation achieves the complexity required for the metacomplexity theorem to hold and can execute a subset of CHR rp with strong complexity bounds. 1 Introduction Constraint Handling Rules (CHR) =-=[5]-=- is a high-level rule based language, originally designed for the implementation of constraint solvers, but also more and more used as a general purpose programming language. Recently, it was shown th... |

65 | On the complexity analysis of static analyses
- McAllester
- 2002
(Show Context)
Citation Context ...algorithms can be implemented in CHR while preserving both time and space complexity [16]. We assume familiarity with CHR (see [5,13]). In “Logical Algorithms” (LA) [9] (and based on previous work in =-=[8,12]-=-), Ganzinger and McAllester present a bottom-up logic programming language for the purpose of facilitating the derivation of complexity results of algorithms described by logical inference rules. This... |

56 | The K.U.Leuven CHR system: Implementation and application
- Schrijvers, Demoen
- 2004
(Show Context)
Citation Context ...hich consists of the compilation of LA programs to CHR rules, combined with a scheduler written in CHR. By using a CHR implementation with advanced indexing support, such as the K.U.Leuven CHR system =-=[14]-=-, our implementation achieves the required complexity. It is the first actual implementation of LA 1 and also a first implementation of a subset of CHR rp with strong complexity bounds. The rest of th... |

50 | The computational power and complexity of constraint handling rules
- Sneyers, Schrijvers, et al.
- 2009
(Show Context)
Citation Context ...nt solvers, but also more and more used as a general purpose programming language. Recently, it was shown that all algorithms can be implemented in CHR while preserving both time and space complexity =-=[16]-=-. We assume familiarity with CHR (see [5,13]). In “Logical Algorithms” (LA) [9] (and based on previous work in [8,12]), Ganzinger and McAllester present a bottom-up logic programming language for the ... |

48 | The refined operational semantics of Constraint Handling Rules
- Duck, Stuckey, et al.
- 2004
(Show Context)
Citation Context ...o fire if no higher priority rule instance can. The operational semantics of CHR rp , denoted by ωp, is described as a state transition system. As in ωt, the theoretical operational semantics for CHR =-=[2]-=-, we represent a state σ as a tuple 〈G, S, B, T 〉n, where G is the goal, a multiset of constraints; S is a set of identified CHR constraints, B is a conjunction of built-in constraints, T is the propa... |

46 |
Analyses, optimizations and extensions of Constraint Handling Rules
- Schrijvers
- 2005
(Show Context)
Citation Context ... a general purpose programming language. Recently, it was shown that all algorithms can be implemented in CHR while preserving both time and space complexity [16]. We assume familiarity with CHR (see =-=[5,13]-=-). In “Logical Algorithms” (LA) [9] (and based on previous work in [8,12]), Ganzinger and McAllester present a bottom-up logic programming language for the purpose of facilitating the derivation of co... |

34 | Optimal union-find in Constraint Handling Rules. Theory and Practice of Logic Programming
- Schrijvers, Frühwirth
- 2006
(Show Context)
Citation Context ... complexity results of algorithms described by logical inference rules. This language resembles CHR in many ways and has often been referred to in the discussion of complexity results of CHR programs =-=[1,6,15,17]-=-. The aim of this paper is to investigate the relationship between both languages. More precisely, we look at how the meta-complexity theorem for LA can be applied to (a subset of) CHR, and how CHR ca... |

30 | A new metacomplexity theorem for bottom-up logic programs
- Ganzinger, McAllester
- 2001
(Show Context)
Citation Context ...algorithms can be implemented in CHR while preserving both time and space complexity [16]. We assume familiarity with CHR (see [5,13]). In “Logical Algorithms” (LA) [9] (and based on previous work in =-=[8,12]-=-), Ganzinger and McAllester present a bottom-up logic programming language for the purpose of facilitating the derivation of complexity results of algorithms described by logical inference rules. This... |

27 | Logical algorithms
- Ganzinger, McAllester
- 2002
(Show Context)
Citation Context ...e. Recently, it was shown that all algorithms can be implemented in CHR while preserving both time and space complexity [16]. We assume familiarity with CHR (see [5,13]). In “Logical Algorithms” (LA) =-=[9]-=- (and based on previous work in [8,12]), Ganzinger and McAllester present a bottom-up logic programming language for the purpose of facilitating the derivation of complexity results of algorithms desc... |

18 | Dijkstra’s algorithm with Fibonacci heaps:An executable description
- Sneyers, Schrijvers, et al.
(Show Context)
Citation Context ... complexity results of algorithms described by logical inference rules. This language resembles CHR in many ways and has often been referred to in the discussion of complexity results of CHR programs =-=[1,6,15,17]-=-. The aim of this paper is to investigate the relationship between both languages. More precisely, we look at how the meta-complexity theorem for LA can be applied to (a subset of) CHR, and how CHR ca... |

14 | As time goes by ii: More automatic complexity analysis of concurrent rule programs
- Frühwirth
(Show Context)
Citation Context ... complexity results of algorithms described by logical inference rules. This language resembles CHR in many ways and has often been referred to in the discussion of complexity results of CHR programs =-=[1,6,15,17]-=-. The aim of this paper is to investigate the relationship between both languages. More precisely, we look at how the meta-complexity theorem for LA can be applied to (a subset of) CHR, and how CHR ca... |

12 | Extending CHR with negation as absence
- Weert, Sneyers, et al.
(Show Context)
Citation Context ...e in which the active 2 We apply matching substitutions directly to the goal, CHR store and built-in store. If the rule bodies contain no built-in constraints, the built-in store remains empty. 3 See =-=[18]-=- for an extension of CHR that allows negated heads.sconstraint does not participate, will not fire. The textual rule order also does not support dynamic rule priorities. 3 Translating Logical Algorith... |

4 |
A constraint-based bottom-up counterpart to definite clause grammars
- Christiansen
- 2003
(Show Context)
Citation Context |

4 | B.: Chr rp: Constraint handling rules with rule priorities - Koninck, Schrijvers, et al. - 2007 |

2 | As time goes by: Automatic complexity analysis of concurrent rule programs - Frühwirth |