Conference Proceedings

Observable confluence for constraint handling rules

Gregory J Duck, Peter J Stuckey, Martin Sulzmann, V Dahl (ed.), I Niemela (ed.)

LOGIC PROGRAMMING, PROCEEDINGS | SPRINGER-VERLAG BERLIN | Published : 2007

Abstract

Constraint Handling Rules (CHR) are a powerful rule based language for specifying constraint solvers. Critical for any rule based language is the notion of confluence, and for terminating CHR programs there is a decidable test for confluence. But many CHR programs that are in practice confluent fail this confluence test. The problem is that the states that illustrate non-confluence are not observable from the initial goals of interest. In this paper we introduce the notion of observable confluence, a more general notion of confluence which takes into account whether states are observable. We devise a test for observable confluence which allows us to verify observable confluence for a range o..

View full abstract