Conferences on Intelligent Computer Mathematics - Birmingham 2008
CICM '08

Doctoral Programme

Birmingham, UK, 29-31 July 2008

Antti Hyvaerinen: Distributed Constraint-Based Search in Grids

Constraint-based search is an emerging field in computer science, where the programmer defines a set of constraints over variables having a given domain. The approach ideally allows for the programmer to define the problem declaratively and have the computer perform a search for a solution to the program. Successful examples of the constraint-based search procedures include propositional satisfiability (SAT) solvers. They have been used, e.g., in industrial circuit verification, test pattern generation, planning, bounded model checking, and cryptanalysis, to name a few examples. This talk aims at exploiting the power of modern computational Grids, which are collections of geographically distributed computers connected with a high-bandwidth network, for solving constraint programs.