Automatic Generation and Selection of Streamlined Constraint Models via Monte Carlo Search on a Model Lattice

Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to reduce the search space, while retaining at least one solution. Previously it has been established that it is possible to generate streamliners automatically from abstract constraint specifications in Essence and that effective combinations of streamliners can allow instances of much larger scale to be solved. A shortcoming of the previous approach was the crude exploration of the power set of all combinations using depth and breadth first search. We present a new approach based on Monte Carlo search over the lattice of streamlined models, which efficiently identifies effective streamliner combinations.

[1]  Sally C. Brailsford,et al.  The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared , 1995, CP.

[2]  Bart Selman,et al.  On the Erdős Discrepancy Problem , 2014, CP.

[3]  Jean-Pierre Hubaux,et al.  Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues , 2002, MobiCom '02.

[4]  Ian P. Gent,et al.  Automatically Improving Constraint Models in Savile Row through Associative-Commutative Common Subexpression Elimination , 2014, CP.

[5]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[6]  Waldo C. Kabat,et al.  Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem , 2004, Journal of Automated Reasoning.

[7]  Meinolf Sellmann,et al.  Streamlined Constraint Reasoning , 2004, CP.

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

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

[10]  Brahim Hnich,et al.  Extensible Automated Constraint Modelling , 2011, AAAI.

[11]  M. Stickel,et al.  Automated reasoning and exhaustive search: Quasigroup existence problems☆ , 1995 .

[12]  Ian Miguel,et al.  Automatically Improving SAT Encoding of Constraint Problems Through Common Subexpression Elimination in Savile Row , 2015, CP.

[13]  Toby Walsh,et al.  CGRASS: A System for Transforming Constraint Satisfaction Problems , 2002, International Workshop on Constraint Solving and Constraint Logic Programming.

[14]  Özgür Akgün.  Extensible automated constraint modelling via refinement of abstract problem specifications , 2017 .

[15]  Stephen P. Schwartz,et al.  The Essence of Essence , 2009 .

[16]  Alan M. Frisch,et al.  Symmetry and Implied Constraints in the Steel Mill Slab Design Problem , 2001 .

[17]  Ian P. Gent,et al.  Minion: A Fast Scalable Constraint Solver , 2006, ECAI.

[18]  H. Sherali,et al.  A Branch-and-Cut Algorithm for Solving an Intraring Synchronous Optical Network Design Problem , 2000 .

[19]  Ian Miguel,et al.  Automatically Generating Streamlined Constraint Models with Essence and Conjure , 2015, CP.

[20]  Simon M. Lucas,et al.  A Survey of Monte Carlo Tree Search Methods , 2012, IEEE Transactions on Computational Intelligence and AI in Games.

[21]  Ian P. Gent,et al.  Automatically improving constraint models in Savile Row , 2017, Artif. Intell..

[22]  Roberto Frucht,et al.  GRACEFUL NUMBERING OF WHEELS AND RELATED GRAPHS , 1979 .

[23]  Ian P. Gent,et al.  Breaking Conditional Symmetry in Automated Constraint Modelling with CONJURE , 2014, ECAI.

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

[25]  Bilal Syed Hussain,et al.  Automated Symmetry Breaking and Model Selection in Conjure , 2013, CP.

[26]  R. Bellman,et al.  Dynamic Programming and Markov Processes , 1960 .

[27]  Toby Walsh,et al.  Matrix modelling: Exploiting common patterns in constraint programming , 2002 .

[28]  Ronan Le Bras,et al.  Double-Wheel Graphs Are Graceful , 2013, IJCAI.

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

[30]  Michal Kouril,et al.  Resolution Tunnels for Improved SAT Solver Performance , 2005, SAT.

[31]  T. Walsh,et al.  Matrix Modelling , 2001 .

[32]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[33]  Ian Miguel,et al.  Symmetry Breaking as a Prelude to Implied Constraints: A Constraint Modelling Pattern , 2004, ECAI.

[34]  Ian Miguel,et al.  Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics , 2009, CP.