A Linear-Logic Semantics for Constraint Handling Rules

One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate logic. However, the more CHR is used as a general-purpose programming language, the more the limitations of that kind of declarative semantics in modelling change become apparent. We propose an alternative declarative semantics based on (intuitionistic) linear logic, establishing strong theorems on both soundness and completeness of the new declarative semantics w.r.t. operational semantics.

• Type: Conference
• Year: 2005
• Where: CP
• Authors: Hariolf Betz, Thom W. Frühwirth
• Keywords: Alternative Declarative Semantics, Artificial Intelligence, CP 2005, Declarative Semantics, Programming Language