메뉴 건너뛰기




Volumn 3709 LNCS, Issue , 2005, Pages 17-31

Symmetry definitions for constraint satisfaction problems

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; MICROSTRUCTURE; NUMERICAL METHODS; PROBLEM SOLVING;

EID: 33646170054     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_5     Document Type: Conference Paper
Times cited : (32)

References (18)
  • 1
    • 0011747452 scopus 로고
    • How to use symmetries in boolean constraint solving
    • F. Benhamou and A. Colmerauer, editors. MIT Press
    • A. Aguirre. How to Use Symmetries in Boolean Constraint Solving. In F. Benhamou and A. Colmerauer, editors, Constraint Logic Programming: Selected Research, pages 287-306. MIT Press, 1992.
    • (1992) Constraint Logic Programming: Selected Research , pp. 287-306
    • Aguirre, A.1
  • 2
    • 84957363249 scopus 로고    scopus 로고
    • Excluding symmetries in constraint-based search
    • J. Jaffar, editor, LNCS 1713, Springer
    • R. Backofen and S. Will. Excluding Symmetries in Constraint-Based Search. In J. Jaffar, editor, Principles and Practice of Constraint Programming - CP'99, LNCS 1713, pages 73-87. Springer, 1999.
    • (1999) Principles and Practice of Constraint Programming - CP'99 , pp. 73-87
    • Backofen, R.1    Will, S.2
  • 4
    • 85029585611 scopus 로고
    • Theoretical study of symmetries in prepositional calculus and applications
    • D. Kapur, editor, LNAI 607. Springer-Verlag
    • B. Benhamou and L. Sais. Theoretical study of symmetries in prepositional calculus and applications. In D. Kapur, editor, Automated Deduction - CADE-11, LNAI 607, pages 281-294. Springer-Verlag, 1992.
    • (1992) Automated Deduction - CADE-11 , pp. 281-294
    • Benhamou, B.1    Sais, L.2
  • 6
    • 0041648567 scopus 로고    scopus 로고
    • Symmetry-breaking predicates for search problems
    • Nov.
    • J. Crawford, M. Ginsberg, E. Luks, and A. Roy. Symmetry-Breaking Predicates for Search Problems. In Proceedings KR'96, pages 149-159, Nov. 1996.
    • (1996) Proceedings KR'96 , pp. 149-159
    • Crawford, J.1    Ginsberg, M.2    Luks, E.3    Roy, A.4
  • 9
    • 84958062112 scopus 로고
    • Eliminating interchangeable values in constraint satisfaction problems
    • E. C. Freuder. Eliminating Interchangeable Values in Constraint Satisfaction Problems. In Proceedings AAAI'91, volume 1, pages 227-233, 1991.
    • (1991) Proceedings AAAI'91 , vol.1 , pp. 227-233
    • Freuder, E.C.1
  • 11
    • 0003084962 scopus 로고    scopus 로고
    • Symmetry breaking during search in constraint programming
    • W. Horn, editor
    • I. P. Gent and B. M. Smith. Symmetry Breaking During Search in Constraint Programming. In W. Horn, editor, Proceedings ECAI'2000, pages 599-603, 2000.
    • (2000) Proceedings ECAI'2000 , pp. 599-603
    • Gent, I.P.1    Smith, B.M.2
  • 12
    • 0027707380 scopus 로고
    • Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems
    • P. Jégou. Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems. In Proceedings AAAI'93, pages 731-736, 1993.
    • (1993) Proceedings AAAI'93 , pp. 731-736
    • Jégou, P.1
  • 13
    • 0002603293 scopus 로고
    • Practical graph isomorphism
    • B. McKay. Practical Graph Isomorphism. Congressus Numerantium, 30:45-87, 1981. (The software tool NAUTY is available for download from http://cs.anu.edu.au/~bdm/nauty/)
    • (1981) Congressus Numerantium , vol.30 , pp. 45-87
    • McKay, B.1
  • 14
    • 0035368402 scopus 로고    scopus 로고
    • Exploiting symmetries within constraint satisfaction search
    • P. Meseguer and C. Torras. Exploiting symmetries within constraint satisfaction search. Artificial Intelligence, 129:133-163, 2001.
    • (2001) Artificial Intelligence , vol.129 , pp. 133-163
    • Meseguer, P.1    Torras, C.2
  • 15
    • 85028827546 scopus 로고
    • On the satisfiability of symmetrical constrained satisfaction problems
    • J. Komorowski and Z. W. Ras, editors, LNAI 689. Springer-Verlag
    • J.-F. Puget. On the Satisfiability of Symmetrical Constrained Satisfaction Problems. In J. Komorowski and Z. W. Ras, editors, Proceedings of ISMIS'93, LNAI 689, pages 350-361. Springer-Verlag, 1993.
    • (1993) Proceedings of ISMIS'93 , pp. 350-361
    • Puget, J.-F.1
  • 16
    • 26844512114 scopus 로고    scopus 로고
    • Automatically exploiting symmetries in constraint programming
    • B. Faltings, A. Petcu, F. Pages, and F. Rossi, editors, LNCS 3419. Springer
    • A. Ramani and I. L. Markov. Automatically Exploiting Symmetries in Constraint Programming. In B. Faltings, A. Petcu, F. Pages, and F. Rossi, editors, CSCLP 2004, LNCS 3419, pages 98-112. Springer, 2005.
    • (2005) CSCLP 2004 , pp. 98-112
    • Ramani, A.1    Markov, I.L.2
  • 17
    • 0004896289 scopus 로고    scopus 로고
    • Using symmetry of global constraints to speed up the resolution of constraint satisfaction problems
    • Aug.
    • P. Roy and F. Pachet. Using Symmetry of Global Constraints to Speed up the Resolution of Constraint Satisfaction Problems. In Workshop on Non Binary Constraints, ECAI-98, Aug. 1998.
    • (1998) Workshop on Non Binary Constraints, ECAI-98
    • Roy, P.1    Pachet, F.2
  • 18
    • 84897712733 scopus 로고    scopus 로고
    • SAT v CSP
    • R. Dechter, editor, LNCS 1894. Springer
    • T. Walsh. SAT v CSP. In R. Dechter, editor, Proceedings CP'2000, LNCS 1894, pages 441-456. Springer, 2000.
    • (2000) Proceedings CP'2000 , pp. 441-456
    • Walsh, T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.