Decidability properties for fragments of CHR

Gabbrielli, Maurizio; Mauro, Jacopo; Meo, Maria Chiara; Sneyers, Jon

doi:10.1017/s1471068410000311

Cited by 4 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [16] we study the decidability of termination for two CHR dialects. CHR is a constraint, rule based concurrent language whose peculiarity is to allow multiple atomic formulas in the head of rules.…”

Section: Expressiveness Of Computational Modelsmentioning

confidence: 99%

Service-Oriented Computing

Orłowska¹,

Weerawarana²,

Papazoglou³

et al. 2017

Lecture Notes in Computer Science

108

View full text Add to dashboard Cite

region] Administrative Assistant Nathalie Woodward [shared with another team] 2. Overall Objectives 2.1. Overall Objectives Ubiquitous Computing refers to the situation in which computing facilities are embedded or integrated into everyday objects and activities. Networks are large-scale, including both hardware devices and software agents. The systems are highly mobile and dynamic: programs or devices may move and often execute in networks owned and operated by others; new devices or software pieces may be added; the operating environment or the software requirements may change. The systems are also heterogeneous and open: the pieces that form a system may be quite different from each other, built by different people or industries, even using different infrastructures or programming languages; the constituents of a system only have a partial knowledge of the overall system, and may only know, or are aware of, a subset of the entities that operate on the system. A prominent recent phenomenon in Computer Science is the emerging of interaction and communication as key architectural and programming concepts. This is especially visible in ubiquitous systems. Complex distributed systems are being thought of and designed as structured composition of computational units, usually referred to as components. These components are supposed to interact with each other and such interactions are supposed to be orchestrated into conversations and dialogues. In the remainder, we will write CBUS for Component-Based Ubiquitous Systems.

show abstract

Section: Expressiveness Of Computational Modelsmentioning

confidence: 99%

Service-Oriented Computing

Orłowska¹,

Weerawarana²,

Papazoglou³

et al. 2017

Lecture Notes in Computer Science

108

View full text Add to dashboard Cite

show abstract

“…While there are many Turing-complete language subsets of CHR [116,66,92] (a single multi-headed simplification rule suffices), it has also been shown in [37,65] that each of the following features of CHR can be considered essential, since they increase the expressive power of CHR: constraints with arguments, built-in constraints, function symbols to build complex terms, multi-headed rules, introduction of new variables in the body of a rule.…”

Section: Chr Language Variants and Extensionsmentioning

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

“…In particular the work presented in Chapter 5 has been published in [49] while Chapters 6,7,8,9, and 10 have been published in [48], [73], [72], [85], and [89] …”

Section: In More Details Inmentioning

confidence: 99%

Constraints Meet Concurrency

Mauro

2014

Atlantis Studies in Computing

Self Cite

View full text Add to dashboard Cite

We investigate the benefits that emerge when the fields of constraint programming and concurrency meet. On one hand, constraints can be use in concurrency theory to increase the conciseness and the expressive power of concurrent languages from a pragmatic point of view. On the other hand, problems modeled by using constraints can be solved faster and more efficiently using a concurrent system. We explore both directions providing two separate lines of contribution. Firstly we study the expressive power of a concurrent language, namely Constraint Handling Rules, that supports constraints as a primitive construct. We show what features of this language make it Turing powerful. Then we propose a framework to solve constraint problems that is intended to be deployed on a concurrent system. For the development of this framework we used the concurrent language Jolie following the Service Oriented paradigm. Based on this experience, we also propose an extension to Service Oriented Languages to overcome some of their limitations and to improve the development of concurrent applications. Needless to say, I am also in debt with my coauthors:

show abstract

Decidability properties for fragments of CHR

Cited by 4 publications

References 14 publications

Service-Oriented Computing

Service-Oriented Computing

Constraint Handling Rules - What Else?

Constraints Meet Concurrency

Contact Info

Product

Resources

About