Applying local search to structural constraint satisfaction

Although domains like a 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 work extends and combines the concept of structural constraint satisfaction problems with the use of local search and global constraints.