Download:
|
by Steven Prestwich
Proceedings of the CP'01 Workshop on Modelling and Problem Formulation
http://4c.ucc.ie/web/upload/publications/inProc/formul.ps
Add To MetaCart
Abstract:
Symmetry breaking and implied constraints can speed up both exhaustive search and the search for a single solution. We experiment with both types of constraint, using three search algorithms (backtracking, local and hybrid) to nd single solutions for SAT encodings of three combinatorial problems (clique, set cover and balanced incomplete block design generation). Both show strong positive and negative eects, depending on the problem class and algorithm. However, symmetry breaking constraints consistently have a negative eect on the incomplete search algorithms. This suggests an opposite strategy when applying stochastic search: maximising symmetry in the constraint model. 1
Citations
|
285
|
Noise strategies for improving local search
– Selman, Kautz, et al.
- 1994
|
|
221
|
Boosting combinatorial search through randomization
– Gomes, Selman, et al.
- 1998
|
|
58
|
Excluding Symmetries in Constraint-Based Search
– Backofen, Will
- 1999
|
|
57
|
Increasing constraint propagation by redundant modelling: An experience report. Constraints, 4:167- 192
– Cheng, Choi, et al.
- 1999
|
|
55
|
On the Satisfiability of Symmetrical Constrained Satisfaction Problems
– Puget
- 1993
|
|
49
|
Symmetry Breaking Predicates for Search Problems
– Crawford, Ginsberg, et al.
- 1996
|
|
44
|
Local search and the number of solutions
– Clark, Frank, et al.
- 1996
|
|
37
|
Adding New Clauses for Faster Local Search
– Cha, Iwama
- 1996
|
|
33
|
Exploiting Symmetries Within Constraint Satisfaction Search
– Meseguer, Torras
- 2001
|
|
32
|
A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences
– Prestwich
- 2000
|
|
30
|
GSAT and Local Consistency
– Kask, Dechter
- 1995
|
|
25
|
Exploiting Symmetry in Lifted CSPs
– Joslin, Roy
- 1997
|
|
24
|
Modelling the Golomb Ruler Problem
– Smith, Stergiou, et al.
- 1999
|
|
20
|
Symmetry Breaking During Search
– Gent, Smith
|
|
15
|
Balanced Incomplete Block Design as Satisfiability
– Prestwich
|
|
12
|
Tables of Parameters of BIBDs with r ^ 41 Including Existence
– Mathon, Rosa
- 1985
|
|
9
|
Trading completeness for scalability: hybrid search for cliques and rulers
– Prestwich
- 2001
|
|
6
|
Look-Ahead Versus Look-Back for Satis Problems
– Li, Anbulagan
- 1997
|
|
3
|
Purdom Jr. Backtrack Searching in the Presence of Symmetry
– Brown, Finkenstein, et al.
- 1988
|
|
3
|
Constraint Programming | An Oz Perspective. Tutorial at the Fifth
– Henz
- 1998
|
