Conference Proceedings

A linear-logic semantics for constraint handling rules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3709 LNCS 137-151
DOI: 10.1007/11564751_13
26Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Betz, H., & Frühwirth, T. (2005). A linear-logic semantics for constraint handling rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 137–151). https://doi.org/10.1007/11564751_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free