CPL Scope
CPL seeks previously unpublished papers that contain- new filtering, propagation, and search algorithms with empirical or theoretical justification;
- the design, implementation, and evaluation of constraint programming systems;
- the design, implementation, and evaluation of constraint programming languages, including programming abstractions, implementation issues, and environments;
- accounts of applications of existing techniques that shed light on the strengths and weaknesses of the methods; of particular interest are those applications for which constraint programming has yielded significant benefits in solution quality, simplicity of use, or deployment cost;
- hybridizations of constraint programming with other techniques, including local search, mathematical programming, evolutionary algorithms, SAT, and symbolic reasoning techniques;
- algorithms and techniques aiming at handling uncertainties, preferences, and dynamic aspects in constraint programming applications;
- modeling and representational issues in constraint programming, and how they affect solution quality and computation times;
- techniques and algorithms for breaking symmetries, and their applications;
- software engineering aspects of constraint programming, including explanations, visualization, and debugging;
- experimental and/or theoretical studies yielding new insight into the design and behavior of constraint programming algorithms and their applications;
- applications of constraint programming in fundamental areas, such as resource allocation, networking, transportation, scheduling, design, configuration, and verification; or
- comparison of the strengths and weaknesses of constraint programming with other techniques on specific case studies.
