A Generic Framework for Constraint-Directed Search and Scheduling. From: AI Magazine | Date: December 22, 1998| Author: | COPYRIGHT 1998 American Association for Artificial Intelligence. This material is published under license from the publisher through the Gale Group, Farmington Hills, Michigan.  All inquiries regarding rights should be directed to the Gale Group.Copyright information

Constraint-directed search is a powerful representation of problems that narrows the field of possible solutions and puts in place the basis for decision-making. It is a point of responsibility to create techniques and solve problems actively and broadly. The Constraint-directed search relies on interdependent intuitions and representational intuition, narrowing solutions and enabling the creation and selection of search techniques.

This article introduces a generic framework for constraint-directed search. The research literature in constraint-directed scheduling is placed within the ...