The Constraint Handling Rules (CHR) language (http://cs.guc.edu.eg/research/constraint-handling-rules.html) is supposedly designed for high-level writing of constraints, but I don't have any experience with it. (My current project involves probabilistic models over symbolic values, and makes relatively light use of constraint propagation, so the writing of propagators has not been my focus.)
I would be very curious to hear if anyone else on this list has experience with it though, and insight into how it compares with Mozart in terms of concurrency (dataflow?) and programmable search. Any insights out there? As for books on the topic, they are listed below. Since Russ has a logic background, he'll probably be drawn more to Apt's and/or Fruhwirths. Dechter's is pretty dry and technical but has deeper insights into the underlying generalizations of how search and inference can be combined. K. Apt Principles of Constraint Programming Cambridge Univ Press 2003 P. Van Hentenryck Constraint Satisfaction in Logic Programming MIT Press 1989 R. Dechter Constraint Processing Morgan-Kaufmann 2003 E. Tsang. Foundations of Constraint Satisfaction Academic Press 1999 K. Marriott & P. J. Stuckey Programming with Constraints MIT Press 1998 T. Fruhwirth & S. Abdennadher Essentials of Constraint Programming Springer 2003 Irene _________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
