메뉴 건너뛰기




Volumn , Issue , 2001, Pages 309-315

Refining the basic constraint propagation algorithm

Author keywords

[No Author keywords available]

Indexed keywords

ARC-CONSISTENCY ALGORITHMS; CONSTRAINT PROPAGATION; CONSTRAINT PROPAGATION ALGORITHMS; CONSTRAINT SOLVERS; OPTIMALITY; TIME COMPLEXITY;

EID: 84880861453     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (135)

References (15)
  • 1
    • 0002812302 scopus 로고
    • Using inference to reduce arc consistency computation
    • Montréal, Canada
    • C. Bessière, E. C. Freuder, and J. C. Régin. Using inference to reduce arc consistency computation. In Proceedings IJCAI'95, pages 592-598, Montréal, Canada, 1995.
    • (1995) Proceedings IJCAI'95 , pp. 592-598
    • Bessière, C.1    Freuder, E.C.2    Régin, J.C.3
  • 2
    • 0032639823 scopus 로고    scopus 로고
    • Using constraint metaknowledge to reduce arc consistency computation
    • C. Bessière, E.C. Freuder, and J.C. Régin. Using constraint metaknowledge to reduce arc consistency computation. Artificial Intelligence, 107:125-148, 1999.
    • (1999) Artificial Intelligence , vol.107 , pp. 125-148
    • Bessière, C.1    Freuder, E.C.2    Régin, J.C.3
  • 3
    • 0028336331 scopus 로고
    • Arc-consistency and arc-consistency again
    • C. Bessière. Arc-consistency and arc-consistency again. Artificial Intelligence, 65:179-190, 1994.
    • (1994) Artificial Intelligence , vol.65 , pp. 179-190
    • Bessière, C.1
  • 7
    • 73949128050 scopus 로고    scopus 로고
    • ILOG. User's manual. 4.3 edition
    • ILOG. User's manual. ILOG Solver, 4.3 edition, 1998.
    • (1998) ILOG Solver
  • 8
    • 84880869878 scopus 로고    scopus 로고
    • User's manual. 0.39 edition
    • F. Laburthe. User's manual. CHOCO, 0.39 edition, 2000.
    • (2000) CHOCO
    • Laburthe, F.1
  • 9
    • 49449120803 scopus 로고
    • Consistency in networks of relations
    • A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99-118, 1977.
    • (1977) Artificial Intelligence , vol.8 , pp. 99-118
    • Mackworth, A.K.1
  • 10
    • 0018730719 scopus 로고
    • RELATIONAL CONSISTENCY ALGORITHMS AND THEIR APPLICATION IN FINDING SUBGRAPH AND GRAPH ISOMORPHISMS.
    • DOI 10.1016/0020-0255(79)90023-9
    • J.J. McGregor. Relational consistency algorithms and their application in finding subgraph and graph isomorphism. Information Science, 19:229-250, 1979. (Pubitemid 10432392)
    • (1979) Information sciences , vol.19 , Issue.3 , pp. 229-250
    • McGregor, J.J.1
  • 12
    • 0030110022 scopus 로고    scopus 로고
    • An empirical study of phase transitions in binary constraint satisfaction problems
    • P. Prosser. An empirical study of phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81:81-109, 1996. (Pubitemid 126349550)
    • (1996) Artificial Intelligence , vol.81 , Issue.1-2 , pp. 81-109
    • Prosser, P.1
  • 14
    • 0026941401 scopus 로고
    • Generic arc-consistency algorithm and its specializations
    • P. Van Hentenryck, Y. Deville, and C.M. Teng. A generic arc-consistency algorithm and its specializations. Artificial Intelligence, 57:291-321, 1992. (Pubitemid 23586696)
    • (1992) Artificial Intelligence , vol.57 , Issue.2-3 , pp. 291-321
    • Van Hentenryck, P.1    Deville, Y.2    Teng C.-Man3
  • 15
    • 0004772520 scopus 로고
    • Why AC-3 is almost always better than AC-4 for establishing arc consistency in CSPs
    • Chambéry, France
    • R.J. Wallace. Why AC-3 is almost always better than AC-4 for establishing arc consistency in CSPs. In Proceedings IJCAI'93, pages 239-245, Chambéry, France, 1993.
    • (1993) Proceedings IJCAI'93 , pp. 239-245
    • Wallace, R.J.1


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