Constraint programming is a powerful technology for expressing and
reasoning about real-world planning and scheduling problems. It permits
a wide range of complex constraints, such as resource constraints,
temporal constraints and sequencing constraints, to be compactly
specified and efficiently reasoned about. The effective solution of
planning and scheduling problems using constraint programming requires
the use of ideas from a wide range of areas from AI and OR (including
knowledge representation, temporal reasoning, reasoning under
uncertainty, constraint relaxation and decomposition techniques). The
aim of this workshop is to foster the introduction of more ideas from
these and other areas.
We welcome submissions on constraint programming approaches to planning and scheduling problems, including theoretical, experimental and applied work. Topics of interest include, but are not limited to:
The workshop will be one full day. The exact format of the workshop will be determined by the response to the call for participation. In addition to technical presentations based on accepted papers, it is likely the workshop will include an invited talk, a panel, and moderated discussion sessions.
Papers must be prepared according to the AAAI style template and must be no more than eight (8) pages long, including figures and bibliography. Papers must be in PDF format and should be submitted via email to Chris Beck (JCB at MIE dot UTORONTO dot CA) no later than January 24, 2005.
Authors of papers at the workshop will be invited to submit to a special issue of AI Communications. A second round of reviewing will determine the contents of the special issue.