메뉴 건너뛰기




Volumn 98, Issue 1-2, 1998, Pages 351-361

No more "partial" and "full looking ahead"

Author keywords

Arc consistency; Constraint propagation; Constraint satisfaction; Directional arc consistency; Looking ahead

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PROBLEM SOLVING; THEOREM PROVING;

EID: 0031699058     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(97)00064-7     Document Type: Article
Times cited : (2)

References (25)
  • 1
    • 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
  • 2
    • 0002812302 scopus 로고
    • Using inference to reduce arc consistency computation
    • C. Mellish, ed., Montreal, Quebec
    • C. Bessière, E.C. Freuder and J.-C. Regin, Using inference to reduce arc consistency computation, in: C. Mellish, ed., Proceedings IJCAI-95, Montreal, Quebec (1995) 592-598.
    • (1995) Proceedings IJCAI-95 , pp. 592-598
    • Bessière, C.1    Freuder, E.C.2    Regin, J.-C.3
  • 3
    • 0043122251 scopus 로고
    • The anatomy of easy problems: A constraint satisfaction formulation
    • Los Angeles, CA
    • R. Dechter and J. Pearl, The anatomy of easy problems: a constraint satisfaction formulation, in: Proceedings IJCAI-85, Los Angeles, CA (1985) 1066-1072.
    • (1985) Proceedings IJCAI-85 , pp. 1066-1072
    • Dechter, R.1    Pearl, J.2
  • 4
    • 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
  • 5
    • 0009455564 scopus 로고
    • An efficient arc consistency algorithm for a class of CSP problems
    • Sydney, Australia
    • Y. Deville and P. Van Hentenryck, An efficient arc consistency algorithm for a class of CSP problems, in: Proceedings IJCAI-91, Sydney, Australia (1991) 325-330.
    • (1991) Proceedings IJCAI-91 , pp. 325-330
    • Deville, Y.1    Van Hentenryck, P.2
  • 6
    • 0028375869 scopus 로고
    • Arc-consistency for continuous variables
    • B. Faltings, Arc-consistency for continuous variables, Artificial Intelligence 65 (1994) 363-376.
    • (1994) Artificial Intelligence , vol.65 , pp. 363-376
    • Faltings, B.1
  • 7
    • 0019899621 scopus 로고
    • A sufficient condition for backtrack-free search
    • E.C. Freuder, A sufficient condition for backtrack-free search, J. ACM 29 (1982) 24-32.
    • (1982) J. ACM , vol.29 , pp. 24-32
    • Freuder, E.C.1
  • 10
    • 0019067870 scopus 로고
    • Increasing tree search efficiency for constraint satisfaction problems
    • R.M. Haralick and G.L. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence 14 (1980) 263-313.
    • (1980) Artificial Intelligence , vol.14 , pp. 263-313
    • Haralick, R.M.1    Elliott, G.L.2
  • 11
    • 0029362452 scopus 로고
    • Testing heuristics: We have it all wrong
    • J.N. Hooker, Testing heuristics: we have it all wrong, J. Heuristics 1 (1995) 33-42.
    • (1995) J. Heuristics , vol.1 , pp. 33-42
    • Hooker, J.N.1
  • 13
    • 49449120803 scopus 로고
    • Consistency in networks or relations
    • A.K. Mackworth, Consistency in networks or relations, Artificial Intelligence 8 (1977) 99-118.
    • (1977) Artificial Intelligence , vol.8 , pp. 99-118
    • Mackworth, A.K.1
  • 14
    • 0018730719 scopus 로고
    • Relational consistency algorithm and their applications in finding subgraph and graph isomorphisms
    • J.J. McGregor, Relational consistency algorithm and their applications in finding subgraph and graph isomorphisms, Inform. Sci. 19 (1979) 229-250.
    • (1979) Inform. Sci. , vol.19 , pp. 229-250
    • McGregor, J.J.1
  • 16
    • 0016050041 scopus 로고
    • Networks of constraints fundamental properties and applications to picture processing
    • U. Montanari, Networks of constraints fundamental properties and applications to picture processing, Inform. Sci. 7 (1974) 95-132.
    • (1974) Inform. Sci. , vol.7 , pp. 95-132
    • Montanari, U.1
  • 17
    • 84990623071 scopus 로고
    • Constraint satisfaction algorithms
    • B.A. Nadel, Constraint satisfaction algorithms, Comput. Intell. 5 (1989) 188-224.
    • (1989) Comput. Intell. , vol.5 , pp. 188-224
    • Nadel, B.A.1
  • 18
    • 0001372340 scopus 로고
    • Hybrid algorithms for the constraint satisfaction problem
    • P. Prosser, Hybrid algorithms for the constraint satisfaction problem, Comput. Intell. 9 (1993) 268-299.
    • (1993) Comput. Intell. , vol.9 , pp. 268-299
    • Prosser, P.1
  • 24
    • 0028566287 scopus 로고
    • On the inherent level of local consistency in constraint networks
    • Seattle, WA
    • P. van Beek, On the inherent level of local consistency in constraint networks, in: Proceedings AAAI-94, Seattle, WA (1994) 368-373.
    • (1994) Proceedings AAAI-94 , pp. 368-373
    • Van Beek, P.1
  • 25
    • 0002530563 scopus 로고    scopus 로고
    • Some practicable filtering techniques for the constraint satisfaction problem
    • Nagoya, Japan August
    • R. Debruyne and C. Bessière, Some practicable filtering techniques for the constraint satisfaction problem, in: Proceedings IJCAI-97, Nagoya, Japan (August 1997) 412-417.
    • (1997) Proceedings IJCAI-97 , pp. 412-417
    • Debruyne, R.1    Bessière, C.2


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