We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Diagrammatic confluence for Constraint Handling Rules.
- Authors
HAEMMERLÉ, RÉMY
- Abstract
Confluence is a fundamental property of Constraint Handling Rules (CHR) since, as in other rewriting formalisms, it guarantees that the computations are not dependent on rule application order, and also because it implies the logical consistency of the program declarative view. In this paper we are concerned with proving the confluence of non-terminating CHR programs. For this purpose, we derive from van Oostrom's decreasing diagrams method a novel criterion on CHR critical pairs that generalizes all preexisting criteria. We subsequently improve on a result on the modularity of CHR confluence, which permits modular combinations of possibly non-terminating confluent programs, without loss of confluence.
- Subjects
CONSTRAINT satisfaction; ARTIFICIAL intelligence; INFORMATION technology; COMPUTER software; REWRITING systems (Computer science); INFORMATION theory
- Publication
Theory & Practice of Logic Programming, 2012, Vol 12, Issue 4/5, p737
- ISSN
1471-0684
- Publication type
Article
- DOI
10.1017/S1471068412000270