On Proving Confluence Modulo Equivalence for Constraint Handling Rules

On Proving Confluence Modulo Equivalence for Constraint Handling Rules

Abstract Previous results on proving confluence for Constraint Handling Rules are extended in two ways in order to allow a larger and more realistic class of CHR programs to be considered confluent. Firstly, we introduce the relaxed notion of confluence modulo equivalence into the context of CHR: while confluence for a terminating program means that all alternative derivations for a query lead to the exact […]

Read Me Leave comment