Loading...
Loading...

Go to the content (press return)

Symmetry breaking in numeric constraint problems

Author
Goldsztejn, A.; Jermann, C.; Ruiz De Angulo, V.; Torras, C.
Type of activity
Presentation of work at congresses
Name of edition
17th International Conference on Principles and Practice of Constraint Programming
Date of publication
2011
Presentation's date
2011
Book of congress proceedings
Principles and practice of constraint programming (CP 2011): 17th International conference, CP 2011: Perugia, Italy, September 12-16, 2011: proceedings
First page
317
Last page
324
Publisher
Springer
DOI
https://doi.org/10.1007/978-3-642-23786-7_25 Open in new window
Repository
http://hdl.handle.net/2117/15235 Open in new window
URL
http://dx.doi.org/10.1007/978-3-642-23786-7_25 Open in new window
Abstract
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.
Citation
Goldsztejn, A. [et al.]. Symmetry breaking in numeric constraint problems. A: International Conference on Principles and Practice of Constraint Programming. "Principles and practice of constraint programming (CP 2011): 17th International conference, CP 2011: Perugia, Italy, September 12-16, 2011: proceedings". Perugia: Springer, 2011, p. 317-324.
Keywords
artificial intelligence PARAULES AUTOR: symmetries, numeric constraints, variable symmetries
Group of research
KRD - Kinematics and Robot Design
ROBiri - IRI Robotics Group

Participants