Static Symmetry Breaking with the Reflex Ordering
Authors: Jimmy H. M. Lee, Zichen Zhu
IJCAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | 6 Experimental Results This section gives four experiments. All static symmetry breaking constraints are posted based on the rowwise variable order and min value order. We compare Reflex Leader with the efficient and widely used static method Lex Leader given the same subset of symmetries. All reflex and lex ordering constraints in the experiments can be simplified to constraints on two disjoint and same sized variable vectors. In searching, we first use the standard rowwise variable order (Rowwise) and min value order. Other orderings, e.g. snake ordering, are also applicable. We skip them for lack of space. We also exploit the smallest min value first (Min Min) variable order and min value order, which align well with Reflex Leader since it always chooses the min value among the values in the domains of all variables to branch. All experiments are conducted using Gecode Solver 4.2.0 on Intel C2D E8400 3.0Ghz processors with 7GB. In our tables, #s denotes the number of solutions, #f denotes the number of failures and t denotes the runtimes. For the last two experiments, an entry with the symbol indicates that the search timed out after the 1-hour limit. The best results are highlighted in bold. |
| Researcher Affiliation | Academia | Jimmy H. M. Lee and Zichen Zhu Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin, N.T., Hong Kong {jlee,zzhu}@cse.cuhk.edu.hk |
| Pseudocode | Yes | Algorithm 1 Reflex(X, Y)... Algorithm 2 Set Pointer(X,Y,fx,cy, ,β,γ)... Algorithm 3 Enforce Y(Y,fx,cy, ,β,γ)... Algorithm 4 Enforce X(fx,cy,x,y, ,β,γ,n)... |
| Open Source Code | No | The paper does not include an unambiguous statement about releasing source code for the described methodology, nor does it provide any direct links to code repositories. |
| Open Datasets | Yes | We first solve the unconstrained matrix problem (n, m, d) which contains only n m variables but no constraints. Error Correcting Code-Lee Distance (ECCLD) problems with parameters (n, c, b) are also tested using the same model by Lee and Zhu [2014]. Both problems have matrix symmetries... NNQueen [Kelsey et al., 2004] and Diagonal Latin Square [Harvey, 2005] of size n are tested. |
| Dataset Splits | No | The paper does not provide specific dataset split information (exact percentages, sample counts, citations to predefined splits, or detailed splitting methodology) needed to reproduce the data partitioning. It describes various constraint satisfaction problems but not how data instances for those problems were split for training/validation/testing. |
| Hardware Specification | Yes | All experiments are conducted using Gecode Solver 4.2.0 on Intel C2D E8400 3.0Ghz processors with 7GB. |
| Software Dependencies | Yes | All experiments are conducted using Gecode Solver 4.2.0 |
| Experiment Setup | Yes | All static symmetry breaking constraints are posted based on the rowwise variable order and min value order... In searching, we first use the standard rowwise variable order (Rowwise) and min value order... We also exploit the smallest min value first (Min Min) variable order and min value order... |