Apologies if you receive this more than once:

More than 240 people have already registered for the joint
ICLP'01/CP'01 conference.  However, due to the recent turmoil in the
world and the fact that many of the workshops have had late
notification dates, the organizers of ICLP'01/CP'01 have extended the
deadline for early registration to 2nd Nov., 2001. Please register as
soon as possible, to take advantage of these reduced rates. Early
registration also helps us in planning better.

INTERNATIONAL CONFERENCE on CONSTRAINT PROGRAMMING, 2001
--------------------------------------------------------

http://www.cs.ucy.ac.cy/~iclpcp01/

MONDAY

08.45 Opening

09.00 Invited talk

      Is Logic Really Dead, or Only Just Sleeping ?
      Robert Kowalski (Imperial College,  London)

10.30 Coffee

11.15 Best papers

      Hybrid Benders Decomposition Algorithms in Constraint Logic
Programming
      Andrew Eremin and Mark Wallace

      Innovative Application:
      Fast Optimal Instruction Scheduling for Single-issue Processors
with
      Arbitrary Latencies
      Peter van Beek and Kent Wilken

      Branch-and-Check: A Hybrid Framework Integrating Mixed Integer
      Programming and Constraint Logic Programming
      Erlendur S. Thorsteinsson

12.45 Lunch

14.30 Technical session (new directions)

      Constraint-based Verification of Client-Server Protocols
      Giorgio Delzanno and Tevfik Bultan

      Collaborative Learning for Constraint Solving
      Susan L. Epstein and Eugene C. Freuder

      Towards Stochastic Constraints Programming: A Study of On-Line
Multi
      Choice Knapsack with Deadlines
      Thierry Benoist, Eric Bourreau, Yves Caseau and Benoit Rottembourg

14.30 Technical session (symmetry)

      Global Cut Framework for Removing Symmetries
      Filippo Focacci and Michela Milano

      Breaking Symmetries
      Torsten Fahle, Stefan Schamberger and Meinolf Sellmann

      The non-existence of (3,1,2)-Conjugate Orthogonal Idempotent Latin

      Square of order 10
      Olivier Dubois

16.00 Coffee

16.45 Technical session (SAT and its extensions)

      Random 3-SAT and BDDs: The Plot Thickens Further
      Alfonso San Miguel Aguirre and Moshe Y. Vardi

      Capturing Structure with Satisfiability
      Ramon Bejar, Alba Cabiscol, Cesar Fernandez, Felip Manya and Carla
Gomes

      Formal Models of Heavy-Tailed Behavior in Combinatorial Search
      Hubie Chen, Carla P. Gomes, and Bart Selman

16.45 Doctoral Tutorial (open to all)

      How to write a good paper
      Krzysztof Apt, CWI and University of Amsterdam

19.00 Welcome Reception/Dinner (at the Hotel)

TUESDAY

09.00 Invited talk

      Constraint Satisfaction and Database Theory
      Moshe Y. Vardi, Rice University

10.00 Technical session (modelling)

      Solving Non-Binary CSPs Using the Hidden Variable Encoding
      Nikos Mamoulis and Kostas Stergiou

10.30 Excursion to Paphos Mosaics & St Paul's Pillar

13.00 Lunch

14.30 Innovative applications:

      Evaluation of Search Heuristics for Embedded System Scheduling
Problems
      Cecilia Ekelin and Jan Jonsson

      Interpreting Sloppy Stick Figures with Constraint-based Subgraph
Matching
      Markus P.J. Fromherz and James V. Mahoney

      Selecting and scheduling observations for agile satellites: some
      lessons from the constraint reasoning community point of view
      Gerard Verfaillie and Michel Lematre

      A Dynamic Distributed Constraint Satisfaction Approach to Resource

      Allocation
      Pragnesh Jay Modi, Hyuckchul Jung, Milind Tambe, Wei-Min Shen, and

      Shriniwas Kulkarni

16.30 Coffee

17.15 Technical session (global constraints)

      A Filtering Algorithm for the Stretch Constraint
      Gilles Pesant

      Network flow problems in constraint programming
      Alexander Bockmayr, Nicolai Pisaruk, and Abderrahmane Aggoun

      Pruning for the minimum Constraint Family and for the number of
distinct
      values Constraint Family
      Nicolas Beldiceanu

17.15 Doctoral Tutorial (open to all)

      How not to give a talk
      Eugene Freuder, Cork Constraint Computation Center

18.15 Poster previews (presentations)

19.00 Posters

20.00 Doctoral Students Gathering

WEDNESDAY

09.00 Invited talk

      What I foresee for 4C.
      Eugene Freuder, Cork Constraint Computation Center

10.00 Technical session (modelling)

      A Constraint Programming Approach to the Stable Marriage Problem
      I.P. Gent, R.W. Irving, D.F. Manlove, P. Prosser, and B.M. Smith

10.30 Coffee

11.00 Technical session (optimization)

      Lower Bounds for Non-binary Constraint Optimization Problems
      Pedro Meseguer, Javier Larrosa and Marti Sanchez

      New Lower Bounds of Constraint Violations for Over-Constrained
Problems
      Jean-Charles Regin, Thierry Petit, Christian Bessiere and
      Jean-Francois Puget

      A General Scheme for Multiple Lower Bound Computation in
Constraint
      Optimization
      Rina Dechter, Kalev Kask and Javier Larrosa

11.00 Tutorial

      Local Search and Constraint Programming
      Filippo Focacci, Francois Laburthe, and Andrea Lodi

12.30 Lunch

13.45 Excursion:
                Aphrodite's Trail
                Performance by the Cyprus Orchestra of Ancient Greek
Musical Organs
                Light Dinner

THURSDAY

09.00 Technical session (new directions)

      Towards Inductive Constraint Solving
      Slim Abdennadher and Christophe Rigotti

      A Temporal Concurrent Constraint Programming Calculus
      Catuscia Palimidessi and Frank D. Valencia

10.00 Innovative applications:

      A Constraint Optimization Framework for Mapping a Digital Signal
      Processing Application onto a Parallel Machine
      J. Mattioli, N. Museux, P. Saveant, and S. de Givry

10.30 Coffee

11.15 Innovative applications:

      iOpt: A Software Toolkit for Heuristic Search Methods
      Christos Voudouris, Raphael Dorne, David Lesaint, and Anne Liret

      AbsCon: a prototype to solve CSPs with abstraction
      Sylvain Merchez, Christophe Lecoutre and Frederic Boussemart

      A Constraint Engine for Manufacturing Process Planning
      Jozsef Vancza and Andras Markus

11.15 Tutorial

      Complexity of Constraint Solving Problems
      Nadia Creignou, Miki Hermann and Reinhard Pichler

12.45 Lunch

14.30 Tutorial

      Constraint programming and Operation Research
      John Hooker

14.30 Tutorial

      Soft constraints theory, algorithms and applications
      Pedro Meseguer, Francesca Rossi and Thomas Scheix

16.00 Coffee

16.30 Technical session (search and propagation)

      Components for State Restoration in Tree Search
      Chiu Wo Choi, Martin Henz, and Ka Boon Ng

      Adaptive Constraint Handling with CHR in Java
      Armin Wolf

      Consistency Maintenance for ABT
      Marius-Calin Silaghi, Djamila Sam-Haroud, and Boi Faltings

16.30 Technical session (geometric constraints)

      Solving Disjunctive Constraints for Interactive Graphical
Applications
      Kim Marriott, Peter Moulder, Peter J. Stuckey, and Alan Borning

      Sweep as a Generic Pruning Technique Applied to the
Non-Overlapping
      Rectangles  Constraint
      Nicolas Beldiceanu and Mats Carlsson

      Non-overlapping Constraints between Convex Polytopes
      Nicolas Beldiceanu, Qi Guo and Sven Thiel

18.30 Conference Dinner at the wine village of Polemi (Cypriot Night)

FRIDAY

09.00 Invited talk

      Toward theoretical frameworks for comparing constraint
      satisfaction models and algorithms
      Peter van Beek, University of Waterloo

10.00 Technical session (phase transition behaviour)

      Phase Transitions and Backbones of Constraint Minimization
Problems
      Weixiong Zhang

10.30 Coffee

11.15 Technical session (phase transition behaviour)

      The Phase Transition of the Linear Inequalities Problem
      Alessandro Armando, Felice Peccia, and Silvio Ranise

      In Search of a Phase Transition in the AC-Matching Problem
      Phokion G. Kolaitis and Thomas Raffill

11.15 Technical session (biology)

      A CLP approach to the protein side-chain placement problem
      Martin T. Swain and Graham J.L. Kemp

      Fast, Constraint-based Threading of HP-Sequences to Hydrophobic
Cores
      Rolf Backofen and Sebastian Will

11.15 Tutorial

      Interval constraints for numerical analysis
      Maarten van Emdem

12.45 Lunch

14.00 Invited Talk

      Alain Colmerauer (University of Marseille, France)
      Solving the mutiplication constraint in several approximation
spaces

15.30 Coffee

16.00 Technical session (optimization)

      Specific Filtering Algorithms for Over-Constrained Problems
      Thierry Petit, Jean-Charles Regin and Christian Bessiere

      Specializing Russian Doll Search
      Pedro Meseguer and Marti Sanchez

16.00 Technical session (hardware and continuous constraints)

      One Flip per Clock Cycle
      Edgar Tan, Martin Henz, and Roland Yap

      Solving Constraint Over Floating-Point Numbers
      Claude Michel, Michel Rueher, and Yahia Lebbah

      Optimal Pruning for Parametric Ordinary Differential Equations
      Micha Janssen, Pascal Van Hentenryck, and Yves Deville

16.00 Doctoral Tutorial (open to all)

      How to transform an idea into a company
      Ashish Gupta, Chief Scientific Officer, Tavant Technologies


17.30 Joint CP & ICLP Panel
        "The future of LP and CP Systems"

SATURDAY (1st of December)

9.00  Workshops till 19.00.

SUNDAY

        Excursions to the Akamas Nature Reserve
        (Optional - Not included in the Registration Fee)


Reply via email to