www.ai-center.com

Reference	Nareyek, A. 1999. Applying Local Search to Structural Constraint Satisfaction. In Proceedings of the 1999 IJCAI Workshop on Intelligent Workflow and Process Management: The New Frontier for AI in Business.
Abstract	Although domains like continuous workflow planning are promising application candidates for constraint programming techniques, conventional constraint satisfaction representations and algorithms are not expressive and reactive enough. Thus, the present paper extends and combines the concept of structural constraint satisfaction with the use of local search and global constraints to satisfy the advanced requirements.
Download	Rules and Regulations     [PostScript; 407 Kb]   [compressed PostScript; 125 Kb]     [download viewer]
Online Content	The article includes content from the AI Center pages below. Please note that the online pages may contain updated/revised versions, and probably do not cover the complete article: Algebraic Graph Grammars Graph Elements for SCSPs Structural Constraints The Representation of Structural Constraints Structural Constraint Satisfaction Problems Application of Structural Constraints Types of Global Constraints Global Search Control Conclusion