Second International Workshop on Modelling and Reformulating Constraint Satisfaction Problems: Towards Systematisation and Automation 29 September 2003 === PROGRAMME === 14:15 Invited Talk - Combinatorial Modeling for Combinatorial Optimization Pascal Van Hentenryck - Discussion: 10 minutes 15:00 Poster Session: 9 posters with short talks, as listed below (Coffe served 15:30-16:15) 16:15 Contributed Talk - A Generalisation of the Backtracking Algorithm M.R.C. van Dongen - Discussion: 5 minutes 16:40 Contributed Talk - Automated Reformulation of Specifications by Safe Delay Constraints Marco Cadoli and Toni Mancini - Discussion: 5 minutes 17:05 Mini Panel: The Role of Auxially Variables in Branching Heuristics - Search Strategies for Optimization: Modelling the SONET Problem Barbara M. Smith - Why Channel? Multiple Viewpoints for Branching Heuristics Brahim Hnich and Toby Walsh - Discussion: 10 minutes 17:45 General discussion ----o---- === POSTERS === Towards Automatic Modeling of Constraint Satisfaction Problems: A System Based on Compositional Refinement Adam Bakewell, Alan M. Frisch and Ian Miguel An Empirical Study of Mutual Routing-Scheduling Reformulation". J. Christopher Beck, Patrick Prosser and Evgeny Selensky Semi-Automatic Modeling by Constraint Acquisition Remi Coletta, Christian Bessiere, Barry O'Sullivan, Eugene C. Freuder, Sarah O'Connell and Joel Quinqueton Introducing ESRA, a Relational Language for Modelling Combinatorial Problems Pierre Flener, Justin Pearson, and Magnus Agren Encoding Connect-4 Using Quantified Boolean Formulae Ian P. Gent and Andrew G. D. Rowley Preference Constraints: New Global Soft Constraints Dedicated to Preference Binary Relations Remy-Robert Joseph, Peter Chan, Michael Hiroux and Goerges Weil A Regular Language Membership Constraint for Sequences of Variables Gilles Pesant Boolean and Pseudo-Boolean Models for Scheduling Steven Prestwich and Colin Quirke A Reformulation of the Bridge Building Problem as Vehicle Routing Evgeny Selensky