Symmetry Breaking in Numeric Constraint Problems.
CP'11: Proceedings of the 17th international conference on Principles and practice of constraint programming（2011）
摘要
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.
更多查看译文
关键词
discrete CSPs,numeric CSPs,proposed inequality,Symmetry-breaking constraint,practical interest,present experimental evidence,solution symmetry,specific case,variable symmetry,well-known LEX constraint,numeric constraint problem,symmetry breaking
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要