New methods to color the vertices of a graph
Communications of the ACM
Backtrack Searching in the Presence of Symmetry
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On the Satisfiability of Symmetrical Constrained Satisfaction Problems
ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Structural Constraint-Based Modeling and Reasoning with Basic Configuration Cells
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Global Cut Framework for Removing Symmetries
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Propagation algorithms for lexicographic ordering constraints
Artificial Intelligence
Snake lex: an alternative to double lex
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Automatic generation of constraints for partial symmetry breaking
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Using a theorem prover for reasoning on constraint problems
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Improving the computational efficiency in symmetrical numeric constraint satisfaction problems
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
Detecting and breaking symmetries by reasoning on problem specifications
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Automatically exploiting symmetries in constraint programming
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
| Hi-index | 0.00 |
Symmetry often appears in real-world constraint satisfaction problems, but strategies for exploiting it are only beginning to be developed. Here, a rationale for exploiting symmetry within depth-first search is proposed, leading to an heuristic for variable selection and a domain pruning procedure. These strategies are then applied to a highly symmetric combinatorial problem, namely the generation of balanced incomplete block designs. Experimental results show that these strategies achieve a reduction of up to two orders of magnitude in computational effort. Interestingly, two previously developed strategies are shown to be particular instances of this approach.