CP/ICAPS 2008 Joint
Workshop on Constraint Satisfaction Techniques for
Planning and Scheduling Problems
September 14, 2008
The areas of AI planning
and scheduling have seen important advances thanks to the application of
constraint satisfaction models and techniques. Many important practical
problems require efficient allocation of resources in the presence of
complex state-dependent constraints. Therefore, solving these problems requires an adequate mixture
of planning, scheduling and resource allocation to competing goal
activities over time in the presence of complex state-dependent
constraints; i.e., solutions to these problems must integrate resource
allocation and plan synthesis capabilities, which can be efficiently
managed by using constraint techniques.
The workshop will aim at providing a forum for researchers in the field of
Artificial Intelligence to discuss novel issues on planning, scheduling,
constraint programming/constraint satisfaction problems (CSPs) and many
other common areas that exist among them. On the whole, the workshop will
mainly focus on managing complex problems where planning, scheduling and
constraint satisfaction must be combined and/or interrelated, which
entails an enormous potential for practical applications and future
This workshop continues the trail of the successful COPLAS'06 and
COPLAS'07 Workshop on
Constraint Satisfaction Techniques for Planning and Scheduling Problems.
Last year, the workshop was a joint workshop for both ICAPS and CP, which provided a broader audience and give the participants of both events
the opportunity to exchange ideas and approaches that lead to a valuable
and fruitful discussion, and inspire forthcoming research.
COPLAS 2008 Proceedings
COPLAS is ranked as
CORE B in ERA Conference Ranking.
papers will be published in a special issue of
The Knowledge Engineering Review (indexed in JCR-SCI)