Learn More
We are investigating the use of a class of logical formulas to de-ne constraint theories and implement constraint solvers at the same time. The representation of constraint evaluation in a declarative formalism greatly facilitates the prototyping, extension, specialization and combination of constraint solvers. In our approach, constraint evaluation is(More)
Motivation Classical optimal union-find algorithm [Tarjan+, JACM 31(2)] implementable in CHR with optimal time complexity [Schrijvers+, WCLP'05,TPLP]. Parallel implementation? Hard problem: No parallel computation model for CHR. Optimal union-find hard to parallelize. Parallel code close to sequential one. Semi-automatic confluence analysis of sequential(More)
We introduce the notion of connuence for Constraint Handling Rules (CHR), a powerful language for writing constraint solvers. With CHR one simpliies and solves constraints by applying rules. Connuence guarantees that a CHR program will always compute the same result for a given set of constraints independent of which rules are applied. We give a decidable,(More)