Book ChapterDOI
Symmetry breaking in Graceful Graphs
Karen E. Petrie,Barbara M. Smith +1 more
- pp 930-934
Reads0
Chats0
TLDR
Symmetry occurs frequently in Constraint Satisfaction Problems (CSPs) and can cause wasted search, because the search for solutions may repeatedly visit partial assignments symmetric to ones already considered.Abstract:
Symmetry occurs frequently in Constraint Satisfaction Problems (CSPs). For instance, in 3-colouring the nodes of a graph, a CSP model that assigns a specific colour to each node has sets of equivalent solutions in which the three colours are permuted. Symmetry in CSPs can cause wasted search, because the search for solutions may repeatedly visit partial assignments symmetric to ones already considered. If a partial assignment does not lead to a solution, neither will any symmetrically equivalent assignment. When searching for all solutions, for every solution found, all the symmetrically equivalent solutions will also be found.read more
Citations
More filters
Journal Article
A Dynamic Survey of Graph Labeling
TL;DR: In this survey I have collected everything I could find on graph labelings techniques that have appeared in journals that are not widely available.
Book
Handbook of Constraint Programming
TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
Book
Handbook of Knowledge Representation
TL;DR: The Handbook of Knowledge Representation is an up-to-date review of twenty-five key topics in knowledge representation written by the leaders of each field, an essential resource for students, researchers and practitioners in all areas of Artificial Intelligence.
Book ChapterDOI
Chapter 2 Satisfiability Solvers
TL;DR: This chapter describes the main solution techniques used in modern SAT solvers, classifying them as complete and incomplete methods, and presents several extensions of the SAT approach currently under development.
Book ChapterDOI
Symmetry in Constraint Programming
TL;DR: This chapter reviews that symmetry in constraints has always been important but in recent years has become a major research area in its own right, and explores the most important application of symmetry in constraint programming to reduce search: “symmetry breaking”.
References
More filters
Journal Article
A Dynamic Survey of Graph Labeling
TL;DR: In this survey I have collected everything I could find on graph labelings techniques that have appeared in journals that are not widely available.
Proceedings Article
Symmetry-breaking predicates for search problems
TL;DR: This work presents a general scheme whereby symmetries are exploited by adding \symmetry-breaking" predicates to the theory, and discusses methods for generating partial symmetry-breaking predicates, and shows that in several speciic cases asymmetries can be broken either fully or partially using a polynomial number of predicates.
Proceedings Article
Symmetry Breaking
TL;DR: This work presents an approach that detects symmetric choice points during the search and enables the user to find solutions for complex problems with minimal effort spent on modeling.
BookDOI
Solving the Kirkman's schoolgirl problem in a few seconds
Nicolas Barnier,Pascal Brisset +1 more
TL;DR: SBDD+, a generic improvement over SBDD which allows a deep pruning when a symmetry is detected during the search and computes the seven unique solutions of Kirkman's problem in a few seconds is proposed.
BookDOI
Principles and Practice of Constraint Programming – CP 2003
TL;DR: Algorithmic Mechanism Design and Constraints, An Euclidean Distance Global Constraint, and more.