Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction

Constraint Handling Rules (CHR) is a declarative rule-based programming language that has cut out its niche over the course of the last 20 years. It generalizes concurrent constraint logic programming to multiple heads, thus closing the gap to multiset transformation systems. Its popular extension CHR with Disjunction (CHR∨) is a multiparadigm declarative programming language that allows embedding of Horn programs with SLD resolution. We analyze the assets and the limitations of the classical declarative semantics of CHR∨ and highlight its natural relationship with linear-logic. We furthermore develop two linear-logic semantics for CHR∨ that differ in the reasoning domain for which they are instrumental. We show their idempotence and their soundness and completeness with respect to the operational semantics. We show how to apply the linear-logic semantics to decide program properties and to reason about operational equivalence of CHR∨ programs.

[1]  Jirí Zlatuska.  Committed-Choice Concurrent Logic Programming in Linear Logic , 1993, Kurt Gödel Colloquium.

[2]  Slim Abdennadher,et al.  Constructing Rule-Based Solvers for Intentionally-Defined Constraints , 2008, Constraint Handling Rules.

[3]  Christophe Rigotti,et al.  Automatic generation of CHR constraint solvers , 2004, Theory and Practice of Logic Programming.

[4]  AndreoliJean-Marc,et al.  LO and behold! Concurrent structured processes , 1990 .

[5]  Khalil Djelloul,et al.  A Unified Semantics for Constraint Handling Rules in Transaction Logic , 2007, LPNMR.

[6]  Jean-Marc Andreoli,et al.  LO and behold! Concurrent structured processes , 1990, OOPSLA/ECOOP '90.

[7]  François Fages,et al.  Linear Concurrent Constraint Programming: Operational and Phase Semantics , 2001, Inf. Comput..

[8]  Slim Abdennadher,et al.  On Confluence of Constraint Handling Rules , 1996, CP.

[9]  Peter J. Stuckey,et al.  The Refined Operational Semantics of Constraint Handling Rules , 2004, ICLP.

[10]  JEAN-MARC ANDREOLI,et al.  Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..

[11]  Thom W. Frühwirth,et al.  A Linear-Logic Semantics for Constraint Handling Rules , 2005, CP.

[12]  Arabellastrasse,et al.  Constraint Handling Rules ? , 1995 .

[13]  Bart Demoen,et al.  The computational power and complexity of constraint handling rules , 2009, TOPL.

[14]  Mutsunori Banbara,et al.  Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic , 2001, ICLP.

[16]  Thom W. Frühwirth,et al.  A complete and terminating execution model for Constraint Handling Rules , 2010, Theory Pract. Log. Program..

[17]  T. Frühwirth,et al.  Equivalence of CHR States Revisited , 2009 .

[18]  Thom W. Frühwirth,et al.  Theory and Practice of Constraint Handling Rules , 1998, J. Log. Program..

[19]  Robert J. Simmons,et al.  Linear Logical Algorithms , 2008, ICALP.

[20]  Dale Miller,et al.  Logic Programming in a Fragment of Intuitionistic Linear Logic , 1994, Inf. Comput..

[21]  Slim Abdennadher,et al.  Operational Semantics and Confluence of Constraint Propagation Rules , 1997, CP.

[22]  Dale Miller.  The pi-Calculus as a Theory in Linear Logic: Preliminary Results , 1992, ELP.

[23]  Sara Negri.  Semantical Observations on the Embedding of Intuitionistic Logic into Intuitionistic Linear Logic , 1995, Math. Struct. Comput. Sci..

[24]  Michael Winikoff,et al.  Programming in Lygon: An Overview , 1996, AMAST.

[25]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[26]  Thom W. Frühwirth,et al.  Constraint Handling Rules , 2009, Constraint Programming.

[27]  Slim Abdennadher,et al.  Chr _ : a Flexible Query Language , 2022 .

[28]  Frank Pfenning,et al.  Monadic concurrent linear logic programming , 2005, PPDP.

[29]  Slim Abdennadher,et al.  Confluence and Semantics of Constraint Simplification Rules , 2004, Constraints.

[30]  Slim Abdennadher,et al.  Essentials of Constraint Programming , 2010, Cognitive Technologies.

[31]  Thom W. Frühwirth,et al.  Probabilistic Constraint Handling Rules , 2002, Electron. Notes Theor. Comput. Sci..