Foundations of Constraint Satisfaction discusses the foundations of constraint satisfaction and presents algorithms for solving constraint satisfaction problems (CSPs). Most of the algorithms described in this book are explained in pseudo code, and sometimes illustrated with Prolog codes (to illustrate how the algorithms could be implemented). Comprised of 10 chapters, this volume begins by defining the standard CSP and the important concepts around it and presenting examples and applications of CSPs. The reader is then introduced to the main features of CSPs and CSP solving techniques (problem reduction, searching, and solution synthesis); some of the most important concepts related to CSP solving; and problem reduction algorithms. Subsequent chapters deal with basic control strategies of searching which are relevant to CSP solving; the significance of ordering the variables, values and compatibility checking in searching; specialized search techniques which gain their efficiency by exploiting problem-specific features; and stochastic search approaches (including hill climbing and connectionist approaches) for CSP solving. The book also considers how solutions can be synthesized rather than searched for before concluding with an analysis of optimization in CSPs. This monograph can be used as a reference by artificial intelligence (AI) researchers or as a textbook by students on advanced AI courses, and should also help knowledge engineers apply existing techniques to solve CSPs or problems which embed CSPs.

In this volume we present the accepted contributions to the Sixth European Conference on Genetic Programming (EuroGP 2003) which took place at the University of Essex, UK on 14-16 April 2003. EuroGP is now a well-established conference and, without any doubt, the most important international event - voted to Genetic Programming occurring in Europe. The proceedings have all been published by Springer-Verlag in the LNCS series. EuroGP began as an - ternational workshop in Paris, France in 1998 (14–15 April, LNCS 1391). Sub- quently the workshop was held in G¨ oteborg, Sweden in 1999 (26–27 May, LNCS 1598) and then EuroGP became an annual conference: in 2000 in Edinburgh, UK (15–16 April, LNCS 1802), in 2001 in Lake Como, Italy (18–19 April, LNCS 2038) and in 2002 in Kinsale, Ireland (3–5 April, LNCS 2278). From the outset, there have always been specialized workshops, co-located with EuroGP, focusing on applications of evolutionary algorithms (LNCS 1468, 1596, 1803, 2037, and 2279). This year was no exception and EvoWorkshops 2003, incorporating Evo- BIO, EvoCOP, EvoIASP, EvoMUSART, EvoSTIM and EvoROB, took place at the University of Essex (LNCS 2611). Genetic Programming (GP) is that part of Evolutionary Computation which solves particular complex problems or tasks by evolving and adapting popu- tions of computer programs, using Darwinian evolution and Mendelian genetics as a source of inspiration.

Foundations of Constraint Satisfaction discusses the foundations of constraint satisfaction and presents algorithms for solving constraint satisfaction problems (CSPs). Most of the algorithms described in this book are explained in pseudo code, and sometimes illustrated with Prolog codes (to illustrate how the algorithms could be implemented). Comprised of 10 chapters, this volume begins by defining the standard CSP and the important concepts around it and presenting examples and applications of CSPs. The reader is then introduced to the main features of CSPs and CSP solving techniques (problem reduction, searching, and solution synthesis); some of the most important concepts related to CSP solving; and problem reduction algorithms. Subsequent chapters deal with basic control strategies of searching which are relevant to CSP solving; the significance of ordering the variables, values and compatibility checking in searching; specialized search techniques which gain their efficiency by exploiting problem-specific features; and stochastic search approaches (including hill climbing and connectionist approaches) for CSP solving. The book also considers how solutions can be synthesized rather than searched for before concluding with an analysis of optimization in CSPs. This monograph can be used as a reference by artificial intelligence (AI) researchers or as a textbook by students on advanced AI courses, and should also help knowledge engineers apply existing techniques to solve CSPs or problems which embed CSPs.

In this volume we present the accepted contributions to the Sixth European Conference on Genetic Programming (EuroGP 2003) which took place at the University of Essex, UK on 14-16 April 2003. EuroGP is now a well-established conference and, without any doubt, the most important international event - voted to Genetic Programming occurring in Europe. The proceedings have all been published by Springer-Verlag in the LNCS series. EuroGP began as an - ternational workshop in Paris, France in 1998 (14–15 April, LNCS 1391). Sub- quently the workshop was held in G¨ oteborg, Sweden in 1999 (26–27 May, LNCS 1598) and then EuroGP became an annual conference: in 2000 in Edinburgh, UK (15–16 April, LNCS 1802), in 2001 in Lake Como, Italy (18–19 April, LNCS 2038) and in 2002 in Kinsale, Ireland (3–5 April, LNCS 2278). From the outset, there have always been specialized workshops, co-located with EuroGP, focusing on applications of evolutionary algorithms (LNCS 1468, 1596, 1803, 2037, and 2279). This year was no exception and EvoWorkshops 2003, incorporating Evo- BIO, EvoCOP, EvoIASP, EvoMUSART, EvoSTIM and EvoROB, took place at the University of Essex (LNCS 2611). Genetic Programming (GP) is that part of Evolutionary Computation which solves particular complex problems or tasks by evolving and adapting popu- tions of computer programs, using Darwinian evolution and Mendelian genetics as a source of inspiration.