The Correspondence Between the Logical Algorithms Language and CHR

Koninck, Leslie De; Schrijvers, Tom; Demoen, Bart

doi:10.1007/978-3-540-74610-2_15

Cited by 7 publications

(15 citation statements)

References 12 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ganzinger and McAllester (2002) propose a formalism called Logical Algorithms (LA) and prove a meta-complexity result. De Koninck, Schrijvers et al (2007a) establish a close correspondence between CHR and LA (see also Section 6.1.3), allowing the LA meta-complexity result to be applied (indirectly) to a large class of CHR programs. De Koninck, Schrijvers et al (2007a) actually address the metacomplexity of CHR rp programs, an extension of CHR discussed in Section 5.1.3.…”

Section: Ad Hoc Analysismentioning

confidence: 94%

“…De Koninck, Schrijvers et al (2007a) have showed how LA programs can easily be translated into CHR rp programs. The opposite only holds for a subset of CHR rp since the LA language lacks the ability to plug in any built-in constraint theory, and also only supports ground constraints (called assertions in LA terminology).…”

Section: Logical Algorithmsmentioning

confidence: 99%

“…The correspondence between both languages makes it possible to apply the meta-complexity result for LA to a subset of CHR rp as explained in Section 3.3.2. It is also interesting that the first actual implementation of LA is that of De Koninck, Schrijvers et al (2007a), which compiles the language into (regular) CHR rules.…”

Section: Logical Algorithmsmentioning

confidence: 99%

See 2 more Smart Citations

As time goes by: Constraint Handling Rules

Sneyers¹,

Weert²,

Schrijvers³

et al. 2009

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers, it is now recognized as an elegant general purpose language.CHR-related research has surged during the decade following the previous survey by Frühwirth (1998). Covering more than 180 publications, this new survey provides an overview of recent results in a wide range of research areas, from semantics and analysis to systems, extensions and applications.

show abstract

Section: Ad Hoc Analysismentioning

confidence: 94%

Section: Logical Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

As time goes by: Constraint Handling Rules

Sneyers¹,

Weert²,

Schrijvers³

et al. 2009

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…-Prolog and Constraint Logic Programming (CLP) programs are translated into CHR ∨ in [10] using Clark's completion. -Logical Algorithms (LA) are mapped into CHR with and without rule priorities in [85]. This are the only known implementations of LA.…”

Section: Embedding Other Formalisms and Languages In Chrmentioning

confidence: 99%

Constraint Handling Rules - What Else?

Frühwirth

2015

Rule Technologies: Foundations, Tools, and Applications

View full text Add to dashboard Cite

Abstract. Constraint Handling Rules (CHR) is both an effective concurrent declarative constraint-based programming language and a versatile computational formalism. While conceptually simple, CHR is distinguished by a remarkable combination of desirable features:-a semantic foundation in classical and linear logic, -an effective and efficient sequential and parallel execution model -guaranteed properties like the anytime online algorithm properties -powerful analysis methods for deciding essential program properties. This overview of some CHR-related research and applications is by no means meant to be complete. Essential introductory reading for CHR provide the survey article [125] and the books [56,63]. Up-to-date information on CHR can be found online at the CHR web-page www. constraint-handling-rules.org, including the slides of the keynote talk associated with this article. In addition, the CHR website dtai. cs.kuleuven.be/CHR/ offers everything you want to know about CHR, including online demo versions and free downloads of the language. Executive SummaryConstraint Handling Rules (CHR) [56] tries to bridge the gap between theory and practice, between logical specification and executable program by abstraction through constraints and the concepts of computational logic. CHR has its roots in constraint logic programming and concurrent constraint programming, but also integrates ideas from multiset transformation and rewriting systems as well as automated reasoning and theorem proving. It seamlessly blends multi-headed rewriting and concurrent constraint logic programming into a compact userfriendly rule-based programming language. CHR consists of guarded reactive rules that transform multisets of relations called constraints until no more change occurs. By the notion of constraint, CHR does not need to distinguish between data and operations, and its rules are both descriptive and executable.In CHR, one distinguishes two main kinds of rules: Simplification rules replace constraints by simpler constraints while preserving logical equivalence, e.g., X≤Y∧Y≤X ⇔ X=Y. Propagation rules add new constraints that are logically redundant but may cause further simplification, e.g., X≤Y∧Y≤Z ⇒ X≤Z. Together with X≤X ⇔ true, these rules encode the axioms of a partial order relation. The rules compute its transitive closure and replace inequalities ≤ by equalities = whenever possible. For example, A≤B∧B≤C∧C≤A becomes A=B∧B=C. More program examples can be found in Section 2. Semantics of CHR are discussed in Section 3.

show abstract

“…Note that in rules ms1 and ms2, the guard prevents the constraints matching the heads from being equal, and so there are no disequality constraints between the CHR constraint identifiers. In (De Koninck et al 2007a) it is derived that the total runtime of this Logical Algorithms program is O(n log n). We defer the complexity analysis of the merge sort algorithm to Section 6.1 where we analyse the CHR rp implementation directly using a new meta-complexity theorem for CHR rp .…”

Section: Its Logical Algorithms Translation Ismentioning

confidence: 99%

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

Koninck

2009

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

This 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 metacomplexity 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.

show abstract

The Correspondence Between the Logical Algorithms Language and CHR

Cited by 7 publications

References 12 publications

As time goes by: Constraint Handling Rules

As time goes by: Constraint Handling Rules

Constraint Handling Rules - What Else?

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

Contact Info

Product

Resources

About