Solving strategies for highly symmetric CSPs

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1999, Pages 400-405

  Meseguer, Pedro ^a   Torras, Carme ^b  

^a ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

^b CSIC   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BALANCED INCOMPLETE BLOCK DESIGN; COMBINATORIAL PROBLEM; COMPUTATIONAL EFFORT; DEPTH FIRST SEARCH; ORDERS OF MAGNITUDE; PRUNING PROCEDURES; REAL-WORLD; VARIABLE SELECTION;

ARTIFICIAL INTELLIGENCE;

EID: 84880666673     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. R. Backofen, and S. Will. Excluding symmetries in concurrent constraint programming. In Workshop on Modeling and Computing with Concurrent Constraint Programming, 1998.
2. D. Brelaz. New methods to color the vertices of a graph. Journal of ACM, 22(4), 251-256, 1979. (Pubitemid 9452014)
3. C.A. Brown, L. Finkelstein, and P.W. Purdom. Backtrack searching in the presence of symmetry. In Proc. 6th int. conf. on applied algebra, algebraic algorithms and error correcting codes, 99-110, 1988.
4. C.H. Colbourn and J.H. Dinitz (Eds.). The CRC Handbook of Combinatorial Designs, CRC Press, 1996.
5. D.G. Corneil and R.A. Mathon. Algorithmic techniques for the generation and analysis of strongly regular graphs and other combinatorial configurations. Ann. of Discrete Math., 2, 1-32, 1978.
6. J. Crawford, M. Ginsberg, E. Luks, and A. Roy. Symmetry-Breaking Predicates for Search Problems. In Proc. of KR-96, USA, 1996.
7. E.G. Freuder. Eliminating interchangeable values in constraint satisfaction problems. In Proc. of AAAI'91, pages 227-233, 1991.
8. i.P. Gent and B. Smith. Symmetry breaking during search in constraint programming. Research report 99.02, School of Computer Studies, University of Leeds.
9. M. Hall. Combinatorial Tht wry, Ed. John Wiley & Sons, Second Edition, 1986.
10. R. Mathon and A. Rosa. Tables of parameters of BIBD with r ≤ 41 including existence, enumeration and resolvability results: an update. Ars Combinatoria, 30, 1990.
11. P. Prosser. Hybrid algorithmic* for the constraint satisfaction problem. Computational Intelligence, 9(3), 268-299, 1993.
12. J.F. Puget. On the satisfiability of symmetrical constrained satisfaction problems. In Proc. oj' ISMIS'93, pages 350-361, Norway, 1993.
13. P. Roy and F. Pachet, Using symmetry of global constraints to speed up the resolution of constraint satisfaction problems. In Proc. of ECAT88 workshop on Non-binary constraints, pages 27-33, Brighton, UK, 1998.
14. W.D. Wallis. Computational and Constructive Design Theory, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1996.