Detecting and breaking symmetries by reasoning on problem specifications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3607 LNAI, Issue , 2005, Pages 165-181

  Mancini, Toni ^a   Cadoli, Marco ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; PROBLEM SOLVING; SPECIFICATIONS;

COMBINATORIAL PROBLEMS; PROBLEM SPECIFICATIONS; REASONING; SEARCH EFFICIENCY;

INFORMATION ANALYSIS;

EID: 26944450468     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11527862_12     Document Type: Conference Paper

References (26)

1. Proc. of CP 2001, v. 2239 of LNCS, 2001. Springer.
2. E. Börger, E. Gräedel, and Y. Gurevich. The Classical Decision Problem. Perspect. in Math. Logic. Springer, 1997.
3. C. A. Brown, L. Finkelstein, and P. W. Purdom. Backtrack searching in the presence of symmetry. In Proc. of Intl. Conf. on Applied Algebra, Algebraic Algorithms and Error Correcting codes, v. 357 of LNCS, pp. 99-110, 1988. Springer.
4. M. Cadoli and T. Mancini. Exploiting functional dependencies in declarative problem specifications. In Proc. of JELIA 2004, v. 3229 of LNAI, 2004. Springer.
5. M. Cadoli and T. Mancini. Using a theorem prover for reasoning on constraint problems. In Proc. of Intl. W. on Modelling and Reformulating CSPs: Towards Systematisation and Automation, in conj. with CP 2004, 2004.
6. M. Cadoli and A. Schaerf. Compiling problem specifications into SAT. Artif. Intell. To appear.
7. J. M. Crawford, M. L. Ginsberg, E. M. Luks, and A. Roy. Symmetry-breaking predicates for search problems. In Proc. of KR'96, pp. 148-159, 1996. Morgan Kaufmann.
8. P. Crescenzi, D. Goldman, C. H. Papadimitriou, A. Piccolboni, and M. Yarmakakis. On the complexity of protein folding. J. of Comp. Biology, 5(3):423-466, 1998.
9. P. Flener, A. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh. Breaking row and column symmetries in matrix models. In Proc. of CP 2002, v. 2470 of LNCS, page 462 ff., 2002. Springer.
10. F. Focacci and M. Milano. Global cut framework for removing symmetries. In Proc. of CP 2001 [1], pp. 77-92.
11. R. Fourer, D. M. Gay, and B. W. Kernigham. AMPL: A Modeling Language for Mathematical Programming. Intl. Thomson Publ., 1993.
12. W. Hart and S. Istrail. HP Benchmarks. Available at http://www. cs.sandia.gov/tech_reports/compbio/tortilla-hp-beachmarks.html.
13. J. Köhler, U. Schöning, and J. Torán. The graph isomorphism problem: its computational complexity. Birkhauser Press, 1993.
14. K. P. Lau and K. A. Dill. A lattice statistical mechanics model of the conformational and sequence spaces of proteins. Macromolecules, 22:3986-3997, 1989.
15. N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, and F. Scarcello. The DLV System for Knowledge Representation and Reasoning. ACM Trans. on Comp. Logic. To appear.
16. B. D. McKay. Nauty user's guide (version 2.2). Available at http://cs.ami.edu.au/~bdm/nauty/nug.pdf, 2003.
17. P. Meseguer and C. Torras. Solving strategies for highly symmetric CSPs. In Proc. of IJCAI'99, pp. 400-405, 1999. Morgan Kaufmann.
18. P. Meseguer and C. Torras. Exploiting symmetries within constraint satisfaction search. Artif. Intell., 129:133-163, 2001.
19. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Math. and Artif. Intell., 25(3,4):241-273, 1999.
20. C. H. Papadimitriou. Computational Complexity. Addison Wesley Publ. Co., 1994.
21. J.-F. Puget. On the satisfiability of symmetrical constrained satisfaction problems. In Proc. of ISMIS'93, v. 689 of LNCS, pp. 350-361, 1993. Springer.
22. A. Ramani, F. A. Aloul, I. L. Markov, and K. A. Sakallak. Breaking instanceindependent symmetries in exact graph coloring. In Proc. of DATE 2004, pp. 324-331, 2004. IEEE Comp. Society Press.
23. B. M. Smith. Dual model of permutation problems. In Proc. of CP 2001 [1], pp. 615-619.
24. P. Van Hentenryck. The OPL Optimization Programming Language. The MIT Press, 1999.
25. P. Van Hentenryck, P. Flener, J. Pearson, and M. Ågren. Tractable symmetry breaking for CSPs with interchangeable values. In Proc. of IJCAI 2003, pp. 277-282, 2003. Morgan Kaufmann.
26. P. Van Hentenryck, P. Flener, J. Pearson, and M. Ågren. Compositional derivation of symmetries for constraint satisfaction. TR 2004-022, Dep. of Inf. Tech., Uppsala Univ., Uppsala, Sweden, 2004.