Opportunities and Challenges for Constraint Programming

Constraint programming has become an important technology for solving hard combinatorial problems in a diverse range of application domains. It has its roots in artificial intelligence, mathematical programming, operations research, and programming languages. This paper gives a perspective on where constraint programming is today, and discusses a number of opportunities and challenges that could provide focus for the research community into the future.

[1]  Bart Selman,et al.  Algorithm portfolios , 2001, Artif. Intell..

[2]  Christian Bessière.  Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings , 2007, CP.

[3]  Arnaud Lallouet,et al.  Consistency for Partially Defined Constraints , 2005, CP.

[4]  Luca Pulina,et al.  A Multi-engine Solver for Quantified Boolean Formulas , 2007, CP.

[5]  Russell Bent,et al.  Online Stochastic Optimization Without Distributions , 2005, ICAPS.

[6]  Roberto Musmanno,et al.  An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands , 2010, Transp. Sci..

[7]  Pascal Van Hentenryck,et al.  Constraint Programming in OPL , 1999, PPDP.

[8]  Stephen F. Smith,et al.  Combining Multiple Heuristics Online , 2007, AAAI.

[9]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[10]  Bruce M. Maggs,et al.  Cutting the electric bill for internet-scale systems , 2009, SIGCOMM '09.

[11]  Warwick Harvey,et al.  Essence: A constraint language for specifying combinatorial problems , 2007, Constraints.

[12]  Ian Miguel,et al.  The Rules of Constraint Modelling , 2005, IJCAI.

[13]  Albert G. Greenberg,et al.  The cost of a cloud: research problems in data center networks , 2008, CCRV.

[14]  Simon Colton,et al.  Constraint Generation via Automated Theory Formation , 2001, CP.

[15]  Christian Bessiere,et al.  Introduction to the special issue on the thirteenth international conference on principles and practice of constraint programming (CP 2007) , 2009, Constraints.

[16]  Feng Zhao,et al.  Energy aware consolidation for cloud computing , 2008, CLUSTER 2008.

[17]  Thorsten Koch,et al.  Constraint Integer Programming: A New Approach to Integrate CP and MIP , 2008, CPAIOR.

[18]  F. Bruss.  Sum the odds to one and stop , 2000 .

[19]  Junshan Zhang,et al.  Distributed Opportunistic Scheduling for Ad Hoc Networks With Random Access: An Optimal Stopping Approach , 2009, IEEE Transactions on Information Theory.

[20]  Tim Roughgarden,et al.  Braess's Paradox in large random graphs , 2010 .

[21]  Peter J. Stuckey,et al.  MiniZinc: Towards a Standard CP Modelling Language , 2007, CP.

[22]  Pascal Van Hentenryck,et al.  The Constraint Logic Programming Language CHIP , 1988, FGCS.

[23]  Alain Colmerauer,et al.  An introduction to Prolog III , 1989, CACM.

[24]  Tim Roughgarden,et al.  On the severity of Braess's Paradox: Designing networks for selfish users is hard , 2006, J. Comput. Syst. Sci..

[25]  João Gama,et al.  Regression Trees from Data Streams with Drift Detection , 2009, Discovery Science.

[26]  Barry O'Sullivan,et al.  A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems , 2005, ECML.

[27]  Ian P. Gent,et al.  Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion , 2007, SARA.

[28]  Eugene C. Freuder,et al.  CP-INSIDE: Embedding Constraint-Based Decision Engines in Business Applications , 2009, CPAIOR.

[29]  Boi Faltings,et al.  Open Constraint Optimization , 2003, CP.

[30]  Pierre Marquis,et al.  A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..

[31]  Barry O'Sullivan,et al.  Constraint Programming and Combinatorial Optimisation in Numberjack , 2010, CPAIOR.

[32]  Toby Walsh,et al.  Transforming and Refining Abstract Constraint Specifications , 2005, SARA.

[33]  Yoav Shoham,et al.  Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions , 2002, CP.

[34]  Russell Bent,et al.  Online stochastic combinatorial optimization , 2006 .

[35]  Dino Pedreschi,et al.  Mobility data mining: discovering movement patterns from trajectory data , 2010, IWCTS '10.

[36]  Gérard Verfaillie,et al.  Constraint Solving in Uncertain and Dynamic Environments: A Survey , 2005, Constraints.

[37]  Yishay Mansour,et al.  Combining Multiple Heuristics , 2006, STACS.

[38]  Michael J. Maher.  SOGgy Constraints: Soft Open Global Constraints , 2009, CP.

[39]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[40]  Eoin O'Mahony,et al.  Using Case-based Reasoning in an Algorithm Portfolio for Constraint Solving ? , 2008 .

[41]  Nic Wilson,et al.  A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs , 2007, CP.

[42]  Boi Faltings,et al.  Open constraint programming , 2005, Artif. Intell..

[43]  Laurent Perron,et al.  Propagation Guided Large Neighborhood Search , 2004, CP.

[44]  Barry O'Sullivan,et al.  Leveraging the Learning Power of Examples in Automated Constraint Acquisition , 2004, CP.

[45]  Joël Quinqueton,et al.  Constraint Acquisition as Semi-Automatic Modeling , 2003, SGAI Conf..

[46]  Barry O'Sullivan,et al.  A Unifying Framework for Generalized Constraint Acquisition , 2008, Int. J. Artif. Intell. Tools.

[47]  RoughgardenTim.  On the severity of Braess's paradox , 2006 .

[48]  Kevin Leyton-Brown,et al.  : The Design and Analysis of an Algorithm Portfolio for SAT , 2007, CP.

[49]  Simon Colton,et al.  Automatic Generation of Implied Constraints , 2006, ECAI.

[50]  Christian Bessiere,et al.  Learning Implied Global Constraints , 2007, IJCAI.

[51]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .