메뉴 건너뛰기




Volumn 165, Issue 2, 2005, Pages 165-185

An optimal coarse-grained arc consistency algorithm

Author keywords

Arc consistency; Constraint networks; Constraint programming systems; Non binary constraints; Path consistency

Indexed keywords

ARTIFICIAL INTELLIGENCE; BENCHMARKING; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SEMANTICS; SET THEORY;

EID: 18944390206     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2005.02.004     Document Type: Article
Times cited : (169)

References (29)
  • 1
    • 84880861453 scopus 로고    scopus 로고
    • Refining the basic constraint propagation algorithm
    • C. Bessière, and J. Régin Refining the basic constraint propagation algorithm Proc. IJCAI-01, Seattle, WA 2001 309 315
    • (2001) Proc. IJCAI-01, Seattle, WA , pp. 309-315
    • Bessière, C.1    Régin, J.2
  • 3
    • 49449120803 scopus 로고
    • Consistency in networks of relations
    • A. Mackworth Consistency in networks of relations Artificial Intelligence 8 1977 99 118
    • (1977) Artificial Intelligence , vol.8 , pp. 99-118
    • MacKworth, A.1
  • 4
    • 0018730719 scopus 로고
    • Relational consistency algorithms and their application in finding subgraph and graph isomorphism
    • J. McGregor Relational consistency algorithms and their application in finding subgraph and graph isomorphism Inform. Sci. 19 1979 229 250
    • (1979) Inform. Sci. , vol.19 , pp. 229-250
    • McGregor, J.1
  • 7
    • 0032639823 scopus 로고    scopus 로고
    • Using constraint metaknowledge to reduce arc consistency computation
    • C. Bessière, E. Freuder, and J. Régin Using constraint metaknowledge to reduce arc consistency computation Artificial Intelligence 107 1999 125 148
    • (1999) Artificial Intelligence , vol.107 , pp. 125-148
    • Bessière, C.1    Freuder, E.2    Régin, J.3
  • 8
    • 0021828305 scopus 로고
    • The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
    • A. Mackworth, and E. Freuder The complexity of some polynomial network consistency algorithms for constraint satisfaction problems Artificial Intelligence 25 1985 65 74
    • (1985) Artificial Intelligence , vol.25 , pp. 65-74
    • MacKworth, A.1    Freuder, E.2
  • 10
    • 0004772520 scopus 로고
    • Why AC-3 is almost always better than AC-4 for establishing arc consistency in CSPs
    • R. Wallace Why AC-3 is almost always better than AC-4 for establishing arc consistency in CSPs Proc. IJCAI-93, Chambéry, France 1993 239 245
    • (1993) Proc. IJCAI-93, Chambéry, France , pp. 239-245
    • Wallace, R.1
  • 11
    • 0028336331 scopus 로고
    • Arc-consistency and arc-consistency again
    • C. Bessière Arc-consistency and arc-consistency again Artificial Intelligence 65 1994 179 190
    • (1994) Artificial Intelligence , vol.65 , pp. 179-190
    • Bessière, C.1
  • 12
    • 0023842374 scopus 로고
    • Network-based heuristics for constraint-satisfaction problems
    • R. Dechter, and J. Pearl Network-based heuristics for constraint-satisfaction problems Artificial Intelligence 34 1988 1 38
    • (1988) Artificial Intelligence , vol.34 , pp. 1-38
    • Dechter, R.1    Pearl, J.2
  • 13
    • 0030110022 scopus 로고    scopus 로고
    • An empirical study of phase transition in binary constraint satisfaction problems
    • P. Prosser An empirical study of phase transition in binary constraint satisfaction problems Artificial Intelligence 81 1-2 1996 81 109
    • (1996) Artificial Intelligence , vol.81 , Issue.1-2 , pp. 81-109
    • Prosser, P.1
  • 20
    • 18944365275 scopus 로고    scopus 로고
    • ILOG Solver 4.4, ILOG S.A.
    • ILOG, User's manual, ILOG Solver 4.4, ILOG S.A., 1999
    • (1999) ILOG, User's Manual
  • 22
    • 0026819962 scopus 로고
    • Arc consistency for factorable relations
    • M. Perlin Arc consistency for factorable relations Artificial Intelligence 53 1992 329 342
    • (1992) Artificial Intelligence , vol.53 , pp. 329-342
    • Perlin, M.1
  • 23
    • 0002647372 scopus 로고
    • Experimental case studies of backtrack vs waltz-type vs new algorithms for satisfying assignment problems
    • J. Gaschnig Experimental case studies of backtrack vs waltz-type vs new algorithms for satisfying assignment problems Proc. CCSCSI-78 1978 268 277
    • (1978) Proc. CCSCSI-78 , pp. 268-277
    • Gaschnig, J.1
  • 24
    • 35248875660 scopus 로고    scopus 로고
    • Exploiting multidirectionality in coarse-grained arc consistency algorithms
    • C. Lecoutre, F. Boussemart, and F. Hemery Exploiting multidirectionality in coarse-grained arc consistency algorithms Proc. CP-03, Kinsale, Ireland 2003 480 494
    • (2003) Proc. CP-03, Kinsale, Ireland , pp. 480-494
    • Lecoutre, C.1    Boussemart, F.2    Hemery, F.3
  • 27
    • 0001059092 scopus 로고    scopus 로고
    • Arc consistency for general constraint networks: Preliminary results
    • C. Bessière, and J. Régin Arc consistency for general constraint networks: preliminary results Proc. IJCAI-97, Nagoya, Japan 1997 398 404
    • (1997) Proc. IJCAI-97, Nagoya, Japan , pp. 398-404
    • Bessière, C.1    Régin, J.2
  • 28
    • 0026941401 scopus 로고
    • A generic arc-consistency algorithm and its specializations
    • P. Van Hentenryck, Y. Deville, and C. Teng A generic arc-consistency algorithm and its specializations Artificial Intelligence 57 1992 291 321
    • (1992) Artificial Intelligence , vol.57 , pp. 291-321
    • Van Hentenryck, P.1    Deville, Y.2    Teng, C.3
  • 29
    • 71049192365 scopus 로고    scopus 로고
    • Arc consistency on n-ary monotonic and linear constraints
    • Y. Zhang, and R. Yap Arc consistency on n-ary monotonic and linear constraints Proc. CP-00, Singapore 2000 470 483
    • (2000) Proc. CP-00, Singapore , pp. 470-483
    • Zhang, Y.1    Yap, R.2


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