8. CP 2002: Ithaca, NY, USA
Pascal Van Hentenryck (Ed.): Principles and Practice of Constraint Programming - CP 2002, 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings. Springer 2002 Lecture Notes in Computer Science ISBN 3-540-44120-4
Technical Papers
Michela Milano, Willem Jan van Hoeve: Reduced Cost-Based Ranking for Generating Promising Subproblems. 1-16
Gautam Appa, Ioannis Mourtos, Dimitris Magos: Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem. 17-32
Yannis Dimopoulos, Alfonso Gerevini: Temporal Planning through Mixed Integer Programming: A Preliminary Report. 47-62
Nicolas Beldiceanu, Mats Carlsson: A New Multi-resource cumulatives Constraint with Negative Heights. 63-79
Tallys H. Yunes: On the Sum Constraint: Relaxation and Applications. 80-92
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh: Global Constraints for Lexicographic Orderings. 93-108
Yahia Lebbah, Michel Rueher, Claude Michel: A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations. 109-123
Vincent A. Cicirello, Stephen F. Smith: Amplification of Search Performance through Randomization of Heuristics. 124-138
Nicola Muscettola: Computing the Envelope for Stepwise-Constant Resource Allocations. 139-154

Richard Ostrowski, Éric Grégoire, Bertrand Mazure, Lakhdar Sais: Recovering and Exploiting Structural Knowledge from CNF Formulas. 185-199
Lintao Zhang, Sharad Malik: Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation. 200-215
Frank Hutter, Dave A. D. Tompkins, Holger H. Hoos: Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT. 233-248
Francesca Rossi, Alessandro Sperduti, Kristen Brent Venable, Lina Khatib, Paul H. Morris, Robert A. Morris: Learning and Solving Soft Temporal Constraints: An Experimental Study. 249-263
Pedro Meseguer, Martí Sánchez, Gérard Verfaillie: Opportunistic Specialization in Russian Doll Search. 264-279
David G. Mitchell: Resolution Complexity of Random Constraints. 295-309
Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi: Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. 310-326
Ola Angelsmark, Peter Jonsson, Svante Linusson, Johan Thapper: Determining the Number of Solutions to Binary CSP Instances. 327-340
Spiros Skiadopoulos, Manolis Koubarakis: Consistency Checking for Qualitative Spatial Reasoning with Cardinal Directions. 341-355

Makoto Yokoo, Koutarou Suzuki, Katsutoshi Hirayama: Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information. 387-401
Barbara M. Smith: A Dual Graph Translation of a Problem in 'Life'. 402-414
Ian P. Gent, Warwick Harvey, Tom Kelsey: Groups and Constraints: Symmetry Breaking during Search. 415-430
Jean-Francois Puget: Symmetry Breaking Revisited. 446-461
Pierre Flener, Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Justin Pearson, Toby Walsh: Breaking Row and Column Symmetries in Matrix Models. 462-476
David Lesaint: Inferring Constraint Types in Constraint Programming. 492-507
Brian C. Williams, Michel D. Ingham: Model-Based Programming: Controlling Embedded Systems by Reasoning About Hidden State. 508-524
Susan L. Epstein, Eugene C. Freuder, Richard J. Wallace, Anton Morozov, Bruce Samuels: The Adaptive Constraint Engine. 525-542
Thi-Bich-Hanh Dao, Arnaud Lallouet, Andrei Legtchenko, Lionel Martin: Indexical-Based Solver Learning. 541-555
Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham: Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions. 556-572
Yongshao Ruan, Eric Horvitz, Henry A. Kautz: Restart Policies with Dependence among Runs: A Dynamic Programming Approach. 573-586
Innovative Applications
Roman Barták: Visopt ShopFloor: On the Edge of Planning and Scheduling. 587-602
Thierry Benoist, Etienne Gaudin, Benoît Rottembourg: Constraint Programming Contribution to Benders Decomposition: A Case Study. 603-617
Marc Christie, Eric Languénou, Laurent Granvilliers: Modeling Camera Control with Constrained Hypertubes. 618-632
Claude Le Pape, Laurent Perron, Jean-Charles Régin, Paul Shaw: Robust and Parallel Solving of a Network Design Problem. 633-648
Muriel Lauvergne, Philippe David, Patrice Boizumault: Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with Constraints. 649-663
Cèsar Fernández, Ramón Béjar, Bhaskar Krishnamachari, Carla P. Gomes: Communication and Computation in Distributed CSP Algorithms. 664-679
Posters
Stefan Ratschan: Continuous First-Order Constraint Satisfactionwith Equality and Disequality Constraints. 680-685

Jakob Mauss, Frank Seelisch, Mugur M. Tatar: A Relational Constraint Solver for Model-Based Engineering. 696-701
Abdallah Elkhyari, Christelle Guéret, Narendra Jussien: Conflict-Based Repair Techniques for Solving Dynamic Scheduling Problems. 702-707
Andrew J. Parkes: Scaling Properties of Pure Random Walk on Random 3-SAT. 708-713
Andrea Roli: Criticality and Parallelism in Structured SAT Instances. 714-719



Meinolf Sellmann: An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint. 744-749
Marc R. C. van Dongen: AC-3d an Efficient Arc-Consistency Algorithm with a Low Space-Complexity. 755-760
Doctoral Program
Georg Ringwelski: Integrating Search Objects in Asynchronous Constraint Solving. 761
Hans Schlenker: Distributed Constraint-Based Railway Simulation. 762
Karen E. Petrie: Symmetry Breaking in Peaceably Coexisting Armies of Queens. 763
Petr Vilím: Batch Processing with Sequence Dependent Setup Times. 764
Tomás Müller: Interactive Heuristic Search Algorithm. 765
Neil Yorke-Smith: On Constraint Problems with Incomplete or Erroneous Data. 766
Andrea Roli: Design of a New Metaheuristic for MAXSAT Problems. 767

Yuan Zhan: Constraint Solving in Test-Data Generation. 770-771
Markus Bohlin: Improving Cost Calculations for Global Constraints in Local Search. 772
Gerrit Renker: A Modeling Framework for Constraints. 773-774
Linda van Norden, Hans van Maaren: A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design. 775-776
Luis Quesada, Peter Van Roy: A Concurrent Constraint Programming Approach for Trajectory Determination of Autonomous Vehicles. 777
Mattias Grönkvist: Using Constraint Propagation to Accelerate Column Generation in Aircraft Scheduling. 778
Kristen B. Venable: Solving and Learning Soft Temporal Constraints; Ceteris Paribus Statements Represented as Soft Constraints Problems. 779
Frank Seelisch: A Partially Solved Form for Heterogeneous Constraints in Disjunctive Normal Form. 780
Iain McDonald: Partial Symmetry Breaking. 782

Zeynep Kiziltan: Reducing Symmetry in Matrix Models. 786
Nicoleta Neagu: Studying Interchangeability in Constraint Satisfaction Problems. 787-788
Robert Glaubius, Berthe Y. Choueiry: Constraint Modeling in the Context of Academic Task Assignment. 789
Ioannis A. Vetsikas: Design Tradeoffs for Autonomous Trading Agents. 790-792



