ian miguel tjltdcsstandacuk apologies multiple copies call papers special issue ai communications constraint programming planning scheduling http4cucciecarchraewikiindexphpnmainaicomcfp scope topic constraint programming powerful technology expressing reasoning realworld planning scheduling problems permits wide range complex constraints resource constraints temporal constraints sequencing constraints compactly specified efficiently reasoned effective solution planning scheduling problems using constraint programming requires use ideas wide range areas ai including knowledge representation temporal reasoning reasoning uncertainty constraint relaxation decomposition techniques welcome submissions constraint programming approaches planning scheduling problems including theoretical experimental applied work topics interest include limited global constraints hybrid methods new applications deployed applications local search heuristic search techniques scheduling v planning scheduling planning sensitivity analysis solution robustness uncertain dynamic problems optimization multiple objectives preferences mixedinitiative planning scheduling distributedmultiagent planning scheduling spatial temporal andor resource constraints paper submission articles prepared according ai communications instructions httpaicomwebcseunsweduaucfphtml note articles submitted rxfhyskba4cuccie rather email address ai communications instructions important dates article submission 1 december 2005 author notification 21 feburary 2006 camera ready 1 april 2006 information see http4cucciecarchraewikiindexphpnmainaicomcfp editors chris beck university toronto canada tom carchrae 4c university college cork ireland andrew davenport ibm tj watson usa emmanuel hebrard unsw sydney nicta australia toby walsh unsw sydney nicta australia wed 06 aug 2008 171841 0100 uai cfp special issue ai communications constraint programming planning scheduling