Exploiting symmetries within constraint satisfaction search
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Groups and Constraints: Symmetry Breaking during Search
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Breaking Row and Column Symmetries in Matrix Models
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Constraints
Algorithm 852: RealPaver: an interval solver using constraint satisfaction techniques
ACM Transactions on Mathematical Software (TOMS)
Solving Global Unconstrained Optimization Problems by Symmetry-Breaking
ICIS '09 Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science
Exploiting single-cycle symmetries in continuous constraint problems
Journal of Artificial Intelligence Research
Breaking symmetries in all different problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Interval propagation and search on directed acyclic graphs for numerical constraint solving
Journal of Global Optimization
Interval Analysis for Certified Numerical Solution of Problems in Robotics
International Journal of Applied Mathematics and Computer Science - Verified Methods: Applications in Medicine and Engineering
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
| Hi-index | 0.00 |
Symmetry-breaking constraints in the form of inequalities between variables have been proposed for a few kind of solution symmetries in numeric CSPs. We show that, for the variable symmetries among those, the proposed inequalities are but a specific case of a relaxation of the well-known LEX constraints extensively used for discrete CSPs. We discuss the merits of this relaxation and present experimental evidences of its practical interest.