This book constitutes the thoroughly refereed and extended post-workshop proceedings of the 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008, held in Rome, Italy, in June 2008.
The 9 revised full papers presented were carefully reviewed and selected from 14 initial submissions. The papers in this volume present original research results, as well as applications, in many aspects of constraint solving and constraint logic programming. Research topics that can be found in the papers are ¯rst-order constraints, symmetry breaking, global constraints, constraint optimization problems, distributed constraint solving problems, soft constraints, as well as the analysis of application domains such as cumulative resource problems and hybrid systems.
Lecture Notes in Artificial Intelligence Edited by R. Goebel, J. Siekmann, and W. Wahlster Subseries of Lecture Notes in Computer Science 5655 Angelo Oddi François Fages Francesca Rossi (Eds.) Recent Advances in Constraints 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008 Rome, Italy, June 18-20, 2008 Revised Selected Papers 13 Series Editors Randy Goebel, University of Alberta, Edmonton, Canada Jörg Siekmann, University of Saarland, Saarbrücken, Germany Wolfgang Wahlster, DFKI and University of Saarland, Saarbrücken, Germany Volume Editors Angelo Oddi ISTC-CNR, Institute of Cognitive Science and Technology National Research Council of Italy Via San Martino della Battaglia 44, 00185 Rome, Italy E-mail:
[email protected] François Fages INRIA Paris-Rocquencourt BP 105, 78153 Le Chesnay Cedex, France E-mail:
[email protected] Francesca Rossi University of Padova, Department of Pure and Applied Mathematics Via Trieste 63, 35121 Padova, Italy E-mail:
[email protected] Library of Congress Control Number: 2009930948 CR Subject Classification (1998): I.2.3, F.3.1-2, F.4.1, D.3.3, F.2.2, G.1.6, I.2.8 LNCS Sublibrary: SL 7 – Artificial Intelligence ISSN ISBN-10 ISBN-13 0302-9743 3-642-03250-8 Springer Berlin Heidelberg New York 978-3-642-03250-9 Springer Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. springer.com © Springer-Verlag Berlin Heidelberg 2009 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper SPIN: 12719471 06/3180 543210 Preface Constraint programming (CP) is a powerful programming paradigm for the declarative description and the effective solving of large combinatorial problems. Based on a strong theoretical foundation, it is increasingly attracting commercial interest. Since the 1990s, CP has been deployed by many industry leaders, in particular to model heterogeneous optimization and satisfaction probl