Book review: Constraint-Based Reasoning by E.C. Freuder and A.K. Mackworth (Eds.) (The MIT Press Cambridge, MA, 1994 )

ABSTRACT

This book is reprinted from Artificial Intelligence: An International Journal, Volume 58, Numbers 1--3, 1992. There are reported new results in constraint-based reasoning. Constraint-based reasoning has a long tradition in artificial intelligence. Many problems to which artificial intelligence techniques are often applied can be described as constraint satisfaction problems.

REFERENCES

• 1: Vipin Kumar, Algorithms for constraint-satisfaction problems: a survey, AI Magazine, v.13 n.1, p.32-44, Spring 1992
• 2: A. K. Mackworth. Constraint satisfaction. In: S. C. Shapiro, ed., <i>The Encyclopedia of AI</i> (Wiley, New York, 1992) 285--293.
• 3: Itay Meiri , Rina Dechter , Judea Pearl, Uncovering trees in constraint networks, Artificial Intelligence, v.86 n.2, p.245-267, Oct. 1996 [doi>10.1016/0004-3702(95)00102-6]
• 4: Norman Sadeh , Mark S. Fox, Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem, Artificial Intelligence, v.86 n.1, p.1-41, Sept. 1996 [doi>10.1016/0004-3702(95)00098-4]