Automatically Generating Streamlined Constraint Models with Essence and Conjure

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, effective streamlined models have been constructed by hand, requiring an expert to examine closely solutions to small instances of a problem class and identify regularities. We present a system that automatically generates many conjectured regularities for a given Essence specification of a problem class by examining the domains of decision variables present in the problem specification. These conjectures are evaluated independently and in conjunction with one another on a set of instances from the specified class via an automated modelling tool-chain comprising of Conjure, Savile Row and Minion. Once the system has identified effective conjectures they are used to generate streamlined models that allow instances of much larger scale to be solved. Our results demonstrate good models can be identified for problems in combinatorial design, Ramsey theory, graph theory and group theory - often resulting in order of magnitude speed-ups.

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

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

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

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

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

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

[7]  Jessica Engel,et al.  Problem , 1902 .

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

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

[10]  MSc PhD Simon Colton BSc Automated Theory Formation in Pure Mathematics , 2002, Distinguished Dissertations.

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

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

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

[14]  Peter J. Stuckey,et al.  The Design of the Zinc Modelling Language , 2008, Constraints.

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

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

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

[18]  C. Dudley Langford 2793. A Conundrum for Form VI , 1958 .

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