Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction

Betz, Hariolf; Frühwirth, Thom

doi:10.1145/2422085.2422086

Cited by 6 publications

(4 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An interesting refinement is the linear-logic semantics [19,20]. It is closer to the operational semantics in that it captures the meaning of constraints as resources, where multiplicities matter.…”

Section: Chr Rules and Their Declarative Semanticsmentioning

confidence: 99%

Constraint Handling Rules - What Else?

Frühwirth

2015

Rule Technologies: Foundations, Tools, and Applications

Self Cite

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

Section: Chr Rules and Their Declarative Semanticsmentioning

confidence: 99%

Constraint Handling Rules - What Else?

Frühwirth

2015

Rule Technologies: Foundations, Tools, and Applications

Self Cite

View full text Add to dashboard Cite

show abstract

“…Since LM is a bottom-up linear logic programming language, it also shares similarities with Constraint Handling Rules (CHR) (Betz and Fr ühwirth 2005;Betz and Fr ühwirth 2013). CHR is a concurrent committed-choice constraint language used to write constraint solvers.…”

Section: Related Workmentioning

confidence: 99%

A Linear Logic Programming Language for Concurrent Programming over Graph Structures

Cruz

Rocha

Goldstein

et al. 2014

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

We have designed a new logic programming language called LM (Linear Meld) for programming graph-based algorithms in a declarative fashion. Our language is based on linear logic, an expressive logical system where logical facts can be consumed. Because LM integrates both classical and linear logic, LM tends to be more expressive than other logic programming languages. LM programs are naturally concurrent because facts are partitioned by nodes of a graph data structure. Computation is performed at the node level while communication happens between connected nodes. In this paper, we present the syntax and operational semantics of our language and illustrate its use through a number of examples.

show abstract

“…The committed-choice principle expresses a don't care nondeterminism, which leads to efficient implementations. CHR have been extended to CHR ∨ [1] that introduces the don't know nondeterminism in CHR [6]. This nondeterminism is freely offered when the host language is Prolog.…”

Section: Introductionmentioning

confidence: 99%

Quantified Constraint Handling Rules

Brault¹,

Stéphan²

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We shift the QCSP (Quantified Constraint Satisfaction Problems) framework to the QCHR (Quantified Constraint Handling Rules) framework by enabling dynamic binder and access to user-defined constraints. QCSP offers a natural framework to express PSPACE problems as finite two-players games. But to define a QCSP model, the binder must be formerly known and cannot be built dynamically even if the worst case won't occur. To overcome this issue, we define the new QCHR formalism that allows to build the binder dynamically during the solving. Our QCHR models exhibit state-of-the-art performances on static binder and outperforms previous QCSP approaches when the binder is dynamic.

show abstract

Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction

Cited by 6 publications

References 30 publications

Constraint Handling Rules - What Else?

Constraint Handling Rules - What Else?

A Linear Logic Programming Language for Concurrent Programming over Graph Structures

Quantified Constraint Handling Rules

Contact Info

Product

Resources

About