Confluence of CHR revisited: invariants and modulo equivalence
Preprint
Abstract
Abstract simulation of one transition system by another is introduced as a means to simulate a potentially infinite class of similar transition sequences within a single transition sequence. This is useful for proving confluence under invariants of a given system, as it may reduce the number of proof cases to consider from infinity to a finite number. The classical confluence results for Constraint Handling Rules (CHR) can be explained in this way, using CHR as a simulation of itself. Using an abstract simulation based on a ground representation, we extend these results to include confluence under invariant and modulo equivalence, which have not been done in a satisfactory way before.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Towards a Constraint Solver for Proving Confluence with Invariant and Equivalence of Realistic CHR Programs2019
- Confluence of CHR Revisited: Invariants and Modulo Equivalence2019
- Confluence and convergence modulo equivalence in probabilistically terminating reduction systemsInternational Journal of Approximate Reasoning, 2019
- On proving confluence modulo equivalence for Constraint Handling RulesFormal Aspects of Computing, 2016
- Confluence Modulo Equivalence in Constraint Handling Rules2015
- Observable Confluence for Constraint Handling Rules2007
- The Refined Operational Semantics of Constraint Handling Rules2004
- Theory and practice of constraint handling rulesThe Journal of Logic Programming, 1998
- Operational semantics and confluence of constraint propagation rules1997
- On confluence for weakly normalizing systemsLecture Notes in Computer Science, 1991