Exploiting symmetries within constraint satisfaction search☆☆This paper is an extended and updated version of [16], presented at the IJCAI-99 conference.
Authors:
- 1 June 2001
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 129 (1-2) , 133-163
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Excluding Symmetries in Constraint-Based Search1999
- An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem1996
- HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEMComputational Intelligence, 1993
- On the satisfiability of symmetrical constrained satisfaction problems1993
- Representation selection for constraint satisfaction: a case study using n-queensIEEE Expert, 1990
- Enhancement schemes for constraint processing: Backjumping, learning, and cutset decompositionArtificial Intelligence, 1990
- Backtrack searching in the presence of symmetry1989
- Combinatorial Theory1988
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980
- Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations1978