对称破缺约束的对称性
Symmetries of Symmetry Breaking Constraints
摘要：
对称性是许多约束程序的一个重要特征。我们表明，任何对称性作用于一组对称性破缺约束可以用来打破对称性。不同的对称性在每个对称类中挑选出不同的解。我们使用这些意见在两种方法中消除对称性的问题。这些方法被设计为具有对称破缺方法的许多优点，这些方法在静态对称破缺约束之后没有一些缺点。特别是，这两种方法修剪搜索空间使用快速和有效的传播张贴的约束，同时减少对称性破缺和分支算法之间的冲突。实验结果表明，这两种方法在一些标准的基准测试中表现良好。
英文摘要：
Symmetry is an important feature of many constraint programs. We show that any symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each symmetry class. We use these observations in two methods for eliminating symmetry from a problem. These methods are designed to have many of the advantages of symmetry breaking methods that post static symmetry breaking constraint without some of the disadvantages. In particular, the two methods prune the search space using fast and efficient propagation of posted constraints, whilst reducing the conflict between symmetry breaking and branching heuristics. Experimental results show that the two methods perform well on some standard benchmarks.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
