Kevin Reilly

Review of:

Hnich B., Carlsson M., Fages F., and Rossi F.

Recent advances in constraints: Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming - CSCLP 2005, Uppsala, Sweden

Lecture Notes in Artificial Intelligence - Springer-Verlag New York, Inc., Secaucus, NJ, 2006.

Computing Reviews, Under review

ACM Categories: Logic And Constraint Programming (F.4.1); General (A.0); Logic Programming (D.1.6...); Language Classifications (D.3.2...); Logic Programming (I.2.3); Conference Proceedings (A.0); Constraint And Logic Languages (D.3.2); Design, Theory, Algorithms

SUMMARY

We give only a summary here ... The review itself, if accepted for publication will appear first on-line and then later in hard copy in Computing Reviews. (The review of a submitted (invited) review take several months, typically.) Here, we provide merely a rough cut of our review and an even rougher cut of the action provided by the book.

The recent advances addressed in this book proceed along four avenues described under the following headings: [1] Global Constraints (3 papers); [2] Search and Heuristics (4 papers); [3] Language and Implementation Issues (2 papers); and [4] Modeling (3 papers). The book has been carefully edited so that each paper is approx. the same size and a similar number of references also occurs. Almost all papers provide demonstrations and experimental work beyond, coordinating with or motivating theory. Again, almost all of the papers offer rich suggestions for further research (the authors' own and some we assume for the reader). [1] Global constraints include several well-known ones and often they are extended to more complex data domains from the usual ones (finite and scalar). [2] Among fare under Search and Heuristics are combinations of heuristics, seeking out ones that work and researching into figuring out why and where they work best (to include inter-leaving them, etc.). [3] Language issues cover two diverse matter, but how to 'best' obtain a type checking capability in the "Constraint Handling Rules" language, a task under itself but one which must address CHR's mode of implementation over the top of a base language (try: Prolog, Java, Haskell, and CLP, a language oriented to contraints (CLP=Constraint Logic Programming) whose own type systems must be respected. [4] Modeling possibly opens the topic range to a huge interface --- we enjoyed a case which deals with a stochastic form of previously addressed problems such as template design, warehouse location, and news vendor problems. When modified, the problems need sophisticated attack methods, perhaps simplifications, perhaps approximations derived from sister science methodologies and more.

Indeed, more is offered in the full CR review as any (future) reader will clearly see. The book is well done and worth reading by those we may have interest in one or more of the topics covered -- or in topic categories outlined above.