Constraint programming systems are software systems that support the modeling and solving of problems using constraint programming. Such systems include constraint programming libraries and runtime systems for constraint programming languages. The workshop will focus on implementation issues of such systems.
Possible topics include, but are not limited to
- software design aspects of CP systems
- data structures and algorithms for constraint solving
- parallelization approaches
- design and implementation of programming/modeling/solving environments for constraint programming
- surveys of often-used but undocumented folklore techniques
- solvers employing techniques other than standard search and propagation, such as conflict-driven learning or multi-valued decision diagrams
- hybrid solvers integrating methods such as local search, mathematical programming, SAT solving, or AI techniques
After three very successful workshops in 2000 (Singapore), 2002 (Ithaca), and 2010 (St Andrews), this fourth iteration will again provide a forum for research in implementation of constraint programming systems.
This workshop encourages submissions and participation from all members of the CP community and all people interested in the implementation of constraint programming systems. It will provide a place at CP where useful results, practical tricks and preliminary work can be presented, which by itself may not be sufficent for a submission to the full conference but is still of interest to other CP practitioners.
Pascal Van Hentenryck and Laurent Michel. Domain Views for Constraint Programming
Vianney Le Clément de Saint-Marcq, Pierre Schaus, Christine Solnon and Christophe Lecoutre. Sparse-Sets for Domain Implementation
Gustavo Gutierrez, Sascha Van Cauwelaert and Peter Van Roy. Implementation of the Relation Domain for Constraint Programming
Jean-Guillaume Fages, Gilles Chabert and Charles Prud'Homme. Combining finite and continuous solvers: Towards a simpler solver maintenance (slides)
Alejandro Arbelaez and Philippe Codognet. A GPU Implementation of Parallel Constraint-based Local Search
Gustavo Gutierrez, Andres Felipe Barco, Miguel Angel Villanueva, Alejandro Cardona, Daniel Montenegro, Sebastián Miller, Juan Francisco Diaz and Camilo Rueda. The Mozart Constraint Subsystem (slides)
Christian Schulte. Implementing Counters with Decay.
Christopher Jefferson. New Opportunities Provided By Dynamic Triggers.
Peter Nightingale. Exploiting Short Supports.
Contributions to the workshop can include paper presentations and system demonstrations. In addition, there will be a lightning track where people get five minutes to present preliminary results, implementation tricks, or system advertisements.
To ensure high quality of the workshop, at least one author of each accepted submission must attend the workshop. Workshop participants need to register through the main conference registration site and pay the workshop registration fee.
Proceedings will be made available electronically during the workshop.
Submissions of papers and extended abstracts is now closed.
Papers and extended abstracts must be submitted as a PDF file in the Lecture Notes in Computer Science (LNCS) style. The page limit is 15 pages plus any number of pages for references. Shorter papers are explicitly welcomed, as are extended abstracts with only a few pages.
Paper submissions will be reviewed by the program committee. Those that are well written and make a worthwhile contribution to the workshop topic will be accepted for publication in the workshop proceedings, and their authors will be able to present their work at the workshop.
For lightning talks and system demonstrations, please email the organising committee at the following address: firstname.lastname@example.org.
- Paper submission deadline:
July 8, 2013
- Notification of acceptance/rejection: August 9, 2013
- Camera-ready version:
August 23, 2013
- Submission deadline for lightning talks: September 6, 2013
- Workshop: September 16, 2010
- Christopher Jefferson, University of St. Andrews
- Peter Nightingale, University of St. Andrews
- Guido Tack, Monash University
- Mats Carlsson, Swedish Institute of Computer Science, Sweden
- Willem-Jan van Hoeve, Carnegie Mellon University, USA
- Xavier Lorca, Ecole des Mines de Nantes, France
- Laurent Michel, University of Connecticut, USA
- Pierre Schaus, Université catholique de Louvain, Belgium
- Paul Shaw, IBM, France
- Radoslaw Szymanek, Vistula University, Warsaw, Poland and Crossing-Tech, Lausanne, Switzerland