Recent Advances in Constraints

丛 书 名：Lecture Notes in Computer Science

版本说明：1

作     者：Krzysztof R. Apt François Fages Francesca Rossi Péter Szeredi Josef Váncza 

I S B N：(纸本) 9783540218340 

出 版 社：Springer Berlin  Heidelberg 

出 版 年：1000年

页      数：VIII, 288页

主 题 词：Software Engineering/Programming and Operating Systems Artificial Intelligence The Computer Industry Programming Techniques Programming Languages, Compilers, Interpreters Logics and Meanings of Programs 

摘      要：Constraint programming is the fruit of several decades of research carried out in mathematical logic, automated deduction, operations research and arti?cial intelligence. The tools and programming languages arising from this research ?eldhaveenjoyedrealsuccessintheindustrialworldastheycontributetosolving hard combinatorial problems in diverse domains such as production planning, communication networks, robotics and bioinformatics. This volume contains the extended and reviewed versions of a selection of papers presented at the Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming (CSCLP2003), which was held from June 30 to July 2, 2003. The venue chosen for the seventh edition of this annual workshop was the Computer and Automation Research Institute of the Hungarian Academy of Sciences (MTA SZTAKI) in Budapest, Hungary. This institute is one of the 20 members of the Working Group on Constraints of the European Research Consortium for Informatics and Mathematics (ERCIM). For many participants this workshop provided the ?rst opportunity to visit their ERCIM partner in Budapest. CoLogNET is the European-funded network of excellence dedicated to s- porting and enhancing cooperation and research on all areas of computational logic, and continues the work done previously by the Compulog Net. In part- ular, the aim of the logic and constraint logic programming area of CoLogNET is to foster and support all research activities related to logic programming and constraint logic programming. The editors would like to take the opportunity and thank all the authors who submitted papers to this volume, as well as the reviewers for their helpful work.