Treffer: Partial symmetry breaking
Title:
Partial symmetry breaking
Authors:
Source:
CP 2002 : principles and practice of constraint programming - CP 2002 (Ithaca NY, 9-13 September 2002)Lecture notes in computer science. :431-445
Publisher Information:
Berlin: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 12 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Intelligence artificielle, Artificial intelligence, Résolution de problèmes, jeux, Problem solving, game playing, Brisure symétrie, Symmetry breaking, Ruptura simetría, Méthode heuristique, Heuristic method, Método heurístico, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Résolution problème, Problem solving, Resolución problema, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Brisure symétrie partielle
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
University of St Andrews, Fife, Scotland, United Kingdom
University of Huddersfield, West Yorkshire, United Kingdom
University of Huddersfield, West Yorkshire, United Kingdom
ISSN:
0302-9743
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.14614489
Database:
PASCAL Archive
Weitere Informationen
In this paper we define partial symmetry breaking, a concept that has been used in many previous papers without being the main topic of any research. This paper is the first systematic study of partial symmetry breaking in constraint programming. We show experimentally that performing symmetry breaking with only a subset of all symmetries can result in greatly reduced run-times. We also look at the consequences of using partial symmetry breaking in terms of variable and value ordering heuristics. Finally, different methods of selecting symmetries are considered before presenting a general algorithm for selecting subsets of symmetries.