[Workshop Details]
[Participation]
[Submission and Selection]
[Important Dates]
[Organization]
[Proceedings]
[Programme]
Constraint Programming (CP) is a powerful technology to solve
combinatorial problems which are ubiquitous in academia and
industry. The last ten years or so have witnessed significant research
devoted to modelling and solving problems with constraints. CP is
now a mature field and has been successfully used for tackling a
wide range of real-life complex applications. However, such a
technology is currently accessible to only a small number of experts.
For CP to be more widely used by non-experts, more research effort
is needed in order to ease the use of the CP technology.
We solicit original papers that contribute to widen
the use of the CP technology.
Workshop topics include (but are not limited to):
- Application papers describing interesting problems
and interesting ways to model them;
- Contributions to understanding modelling that
could guide the manual or automatic formulation of
models;
- Identification of the criteria that should be used in evaluating models
and the design of pragmatic techniques that facilitate the choice among
alternative models;
- Design of higher level modelling languages;
- Automatic reformulation techniques.
This workshop is the fourth in a series, the previous three being
held at CP'02, CP'03, and CP'04. Details of the series can be found at
here .
The full text for call for papers can be found here .
[Top of the page]
To encourage participation, organisers ask for standard
contributions including research results on the workshop topics,
as well as submissions posting challenging problems to be
discussed at the workshop. At least one author of each submission
accepted for presentation must attend the workshop and present
the contribution. All workshop participants must
pay the CP/International Conferences on Logic Programming registration
fee in addition to the workshop fee. Note that a payment of a single
fee provides admission to all CP/ICLP workshops.
The workshop is open to all members of the CP community and other related communities.
[Top of the page]
To submit a paper to the workshop, please email a postscript or PDF file,
preferably in Springer LNCS format to the workshop chairs
at cp05ws@4c.ucc.ie .
Papers can be of any length but should not exceed 15 pages.
All submissions must be received by July 7, 2005 .
The organising committee will acknowledge all
submissions. If a submitted paper is not acknowledged in 2
working days, the authors are kindly asked to contact the chair.
All submissions will be reviewed and those that present a
significant contribution to the workshop topics will be accepted
for publication in the workshop proceedings. The proceedings will
be available electronically at the workshop page and in hard copy
on the day of the workshop.
[Top of the page]
- Paper submission deadline: July 07, 2005
- Notification of authors: July 27, 2005
- Camera ready version deadline: August 24, 2005
- CP Early Registration deadline: 01 August 2005
[Top of the page]
Organizing Committee:
Programme Committee (Preliminary):
- Chris Beck:
University of Toronto, Canada
- Nicholas Beldiceanu:
Ecole des Mines de Nantes, France
- Alan M. Frisch:
University of York, United Kingdom.
- François Laburthe:
Bouygues, France
- Jimmy Lee:
The Chinese University of Hong Kong, Hong Kong
- Marco Cadoli:
Universita` di Roma "La Sapienza", Italy.
- Brahim Hnich, Joint Chair:
University College Cork, Ireland.
- Jean-François Puget:
ILOG, France
- Steve Prestwich:
University College Cork, Ireland
- Patrick Prosser, Joint Chair:
Glasgow University, Scotland
- Paul Shaw:
ILOG, France
- Barbara Smith, Joint Chair:
University College Cork, Ireland.
[Top of the page]
The proceedings of the workshop as a single pdf file is available online here.
October 01, 2005
09:00--09:10 Workshop Opening
09:10--09:35 Alan M. Frisch, Matthew Grum, Chris Jeferson,
Bernadette Martinez Hernandez, and Ian Miguel.
The Essence of
Essence: A Constraint Language for Specifying Combinatorial
Problems.
09:35--10:00 S. Prestwich.
Increasing Solution Density by Dominated
Relaxation.
10:00--10:25 Duc Nghia Pham, John Thornton, and Abdul Sattar.
Modelling and Solving Temporal Reasoning as Propositional
Satisfiability.
10:25--10:45 Bernadette Martinez Hernandez and Alan M. Frisch.
The systematic generation of channelling constraints.
10:45--11:15 Coffee Break
11:15--11:36 A. Dechter and R. Dechter.
Optimization Models for
Generating Graduation Roadmaps.
11:36--11:57 David F. Manlove, Gregg O’Malley, Patrick Prosser, and
Chris Unsworth.
A Constraint Programming Approach to the Hospitals
/ Residents Problem.
11:57--12:18 Diego Olivier Fernandez Pons.
Models for the rack
configuration problem.
12:18--12:39 Helmut Simonis.
Sudoku as a Constraint Problem.
12:39--13:00 Christopher Jefferson and Alan M. Frisch.
Representations of Sets and Multisets in
Constraint Programming.
List of accepted papers
- A. Dechter and R. Dechter. Optimization Models for
Generating Graduation Roadmaps.
- S. Prestwich. Increasing Solution Density by Dominated
Relaxation.
- Duc Nghia Pham, John Thornton, and Abdul Sattar.
Modelling and Solving Temporal Reasoning as Propositional
Satisfiability.
- David F. Manlove, Gregg O’Malley, Patrick Prosser, and
Chris Unsworth. A Constraint Programming Approach to the Hospitals
/ Residents Problem.
- Diego Olivier Fernandez Pons. Models for the rack
configuration problem.
- Helmut Simonis. Sudoku as a Constraint Problem.
- Alan M. Frisch, Matthew Grum, Chris Jeferson,
Bernadette Martinez Hernandez, and Ian Miguel. The Essence of
Essence: A Constraint Language for Specifying Combinatorial
Problems.
- Christopher Jefferson and Alan M. Frisch.
Representations of Sets and Multisets in
Constraint Programming.
- Bernadette Martinez Hernandez and Alan M. Frisch. The systematic generation of
channelling constraints.
[Top of the page]
Comments concerning this page should go to brahim-at-4c.ucc.ie