Exploiting symmetries within constraint satisfaction search

Artificial Intelligence

Volumn 129, Issue 1-2, 2001, Pages 133-163

  Meseguer, Pedro ^a   Torras, Carme ^b  

^a ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

^b CSIC   (Spain)

Author keywords

Constraint satisfaction; Heuristics; Nogoods; Symmetry

Indexed keywords

CONSTRAINT THEORY; DECISION THEORY; HEURISTIC METHODS; PROBLEM SOLVING;

RAMSEY THEORY;

ARTIFICIAL INTELLIGENCE;

EID: 0035368402     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00104-7     Document Type: Article

References (24)

1. Excluding symmetries in constraint based search
2. The hazards of fancy backtracking
3. Backtrack searching in the presence of symmetry
4. Algorithmic techniques for the generation analysis of strongly regular graphs and other combinatorial configurations
5. Symmetry-breaking predicates for search problems
6. Enhancement schemes for constraint processing backjumping, learning and cutset decomposition
7. Eliminating interchangeable values in constraint satisfaction problems
8. An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem
9. Symmetry breaking in constraint programming
10. Increasing tree search efficiency for constraint satisfaction problems
11. Tables of parameters of BIBD with r ≤ 41 including existence enumeration and resolvability results: An update
12. Solving strategies for highly-symmetric CSPs
13. Representation selection for constraint satisfaction: A case study using n-queens
14. Hybrid algorithmics for the constraint satisfaction problem
15. On the satisfiability of symmetrical constrained satisfaction problems
16. Using symmetry of global constraints to speed up the resolution of constraint satisfaction problems
17. Symmetries the cardinality operator
18. Trying harder to fail first