[eclipse-clp-users] Integer constraint solver with CHR, example code?

From: Ulrich Scholz <Ulrich.Scholz_at_...10...>
Date: Mon, 19 Jan 2009 13:47:50 +0100
Dear all,

I'm interested in a constraint solver over Integer domains that shows
reliable fast failure.  For example X=Y, X>Z, Y=Z should fail instantly
without the need for labeling.

Maybe I will have to implement it myself with CHR's.  Does anyone have a
"good" implementation of such a solver in CHR?  I want to get an idea of a
good implementation.

(But: If I could copy the code and it would fit - even better)


Ulrich Scholz            

Phone: +49-6221-533244
Email: ulrich.scholz_at_...10...


European Media Laboratory GmbH
Schloss-Wolfsbrunnenweg 33
69118 Heidelberg

Amtsgericht Mannheim / HRB 335719
Managing Partner: Dr. h.c. Klaus Tschira, Scientific and Managing
Director: Prof. Dr.-Ing. Andreas Reuter

Received on Mon Jan 19 2009 - 12:48:09 CET

This archive was generated by hypermail 2.3.0 : Tue Aug 20 2019 - 12:15:19 CEST