Ian P. Gent, Barbara Smith  Home/Search
Context Related
| agora.leeds.ac.uk/scs/doc...99_02.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcs.stand.ac.uk/~ipg/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce a method for symmetry breaking during search (SBDS) in constraint programming. It has the great advantage of not interfering with heuristic choices. It guarantees to return a unique solution from each set of symmetrically equivalent ones, which is the one found first by the variable and value ordering heuristics. We prove this claim, describe a general implementation of SBDS in ILOG Solver, and describe applications to low autocorrelation binary sequences and the n-queens... (Update)
Cited by: More
Static and Dynamic Structural Symmetry Breaking - Pierre Flener Justin (2006) (Correct)
Proceedings CPAIOR'02 - Heuristic Constraint Propagation (Correct)
Symmetry Breaking - Torsten Fahle Stefan (2001) (Correct)
Similar documents (at the sentence level):
36.0%: Symmetry Breaking in Constraint Programming - Gent, Smith (2000) (Correct)
Active bibliography (related documents): More All
0.2: Combining Branch&Bound and SBDD to Solve Soft CSPs - Bistarelli, O'Sullivan (2004) (Correct)
0.2: Symmetry Breaking in Soft CSPs - Stefano Bistarelli Istituto (2003) (Correct)
0.1: Symmetry in Matrix Models - Flener, Frisch, Hnich, Kiziltan.. (2001) (Correct)
Similar documents based on text: More All
0.7: Reducing The Number of Constraints Needed During Symmetry.. - Pearson (Correct)
0.2: Tractable Symmetry Breaking for CSPs with Interchangeable.. - Van Hentenryck Department (2003) (Correct)
0.2: A Polynomial Algorithm for Finding a Cycle Covering a Given Set of.. - Yeo (1998) (Correct)
Related documents from co-citation: More All
10: Reducing symmetry in a combinatorial design problem - Smith - 2001
10: Excluding symmetries in constraintbased search - Backofen, Will - 1999
9: Increasing constraint propagation by redundant modeling: an experience report - Cheng, Choi et al. - 1999
BibTeX entry: (Update)
Ian P. Gent and Barbara Smith. Symmetry breaking during search in constraint programming. Report 99.02, University of Leeds, January 1999. http://citeseer.ist.psu.edu/gent99symmetry.html More
@misc{ gent99symmetry,
author = "I. Gent and B. Smith",
title = "Symmetry breaking during search in constraint programming",
text = "Ian P. Gent and Barbara Smith. Symmetry breaking during search in constraint
programming. Report 99.02, University of Leeds, January 1999.",
year = "1999",
url = "citeseer.ist.psu.edu/gent99symmetry.html" }
Citations (may not include all citations):54 Symmetry-Breaking Predicates for Search Problems - Crawford, Ginsberg et al. - 1996
27 Backtrack Searching in the Presence of Symmetry (context) - Brown, Finkelstein et al. - 1988
23 the Satisfiability of Symmetrical Constrained Satisfaction P.. (context) - Puget - 1993
10 Constraint Techniques for Solving the Protein Structure Pred.. - Backofen - 1998
9 Excluding Symmetries in Concurrent Constraint Programming - Backofen, Will - 1998
9 the maximal triangle-free edgechromatic graphs in three colo.. (context) - Kalbfleisch, Stanton - 1968
9 Exhaustive search for low-autocorrelation binary sequences - Mertens - 1996
2 Using Symmetry of Global Constraints to Speed up the Resolut.. (context) - Roy, Pachet - 1998
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC