Parallelism, concurrency and distribution in constraint handling rules: A survey. Issue 5 (23rd May 2018)

• Record Type: Journal Article
• Authors: FRÜHWIRTH, THOM
• Is Part Of: Theory and practice of logic programming. Volume 18:Issue 5/6(2018)
• Page Start: 759
• Page End: 805
• Publication Date: 2018-05-23
• Subjects: parallelism, -- concurrency, -- distribution, -- constraint handling rules, -- declarative programming, -- concurrent constraint programming, -- semantics, -- rewriting, -- concurrency models; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068418000078
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: Constraint Handling Rules (CHR) is both an effective concurrent declarative programming language and a versatile computational logic formalism. In CHR, guarded reactive rules rewrite a multi-set of constraints. Concurrency is inherent, since rules can be applied to the constraints in parallel. In this comprehensive survey, we give an overview of the concurrent, parallel as well as distributed CHR semantics, standard and more exotic, that have been proposed over the years at various levels of refinement. These semantics range from the abstract to the concrete. They are related by formal soundness results. Their correctness is proven as a correspondence between parallel and sequential computations. On the more practical side, we present common concise example CHR programs that have been widely used in experiments and benchmarks. We review parallel and distributed CHR implementations in software as well as hardware. The experimental results obtained show a parallel speed-up for unmodified sequential CHR programs. The software implementations are available online for free download and we give the web links. Due to its high level of abstraction, the CHR formalism can also be used to implement and analyse models for concurrency. To this end, the Software Transaction Model, the Actor Model, Colored Petri Nets and the Join-Calculus have been faithfully encoded in CHR. Finally, we identify and discuss commonalities of the approaches surveyed and indicate what problems are left open for future research.