메뉴 건너뛰기




Volumn , Issue , 2004, Pages 197-202

Tractable tree convex constraint networks

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CONSTRAINT THEORY; PROBLEM SOLVING; SET THEORY; TELECOMMUNICATION; TREES (MATHEMATICS);

EID: 9444291275     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (12)
  • 1
    • 0026868943 scopus 로고
    • From local to global consistency
    • Dechter, R. 1992. From local to global consistency. Artificial Intelligence 55:87-107.
    • (1992) Artificial Intelligence , vol.55 , pp. 87-107
    • Dechter, R.1
  • 2
    • 0009346925 scopus 로고    scopus 로고
    • Constraint satisfaction over connected row convex constraints
    • Nagoya, Japan
    • Deville, Y.; Barette, O.; and Van Hentenryck, P. 1997. Constraint satisfaction over connected row convex constraints. In Proceedings of IJCAI-97, volume 1, 405-411. Nagoya, Japan: IJCAI Inc. (See also Artificial Intelligence 109(1999): 243-271).
    • (1997) Proceedings of IJCAI-97 , vol.1 , pp. 405-411
    • Deville, Y.1    Barette, O.2    Van Hentenryck, P.3
  • 3
    • 0033522706 scopus 로고    scopus 로고
    • Deville, Y.; Barette, O.; and Van Hentenryck, P. 1997. Constraint satisfaction over connected row convex constraints. In Proceedings of IJCAI-97, volume 1, 405-411. Nagoya, Japan: IJCAI Inc. (See also Artificial Intelligence 109(1999): 243-271).
    • (1999) Artificial Intelligence , vol.109 , pp. 243-271
  • 4
    • 0018031196 scopus 로고
    • Synthesizing constraint expressions
    • Freuder, E. 1978. Synthesizing constraint expressions. Communications of ACM 21(11):958-966.
    • (1978) Communications of ACM , vol.21 , Issue.11 , pp. 958-966
    • Freuder, E.1
  • 5
    • 0019899621 scopus 로고
    • A sufficient condition for backtrack-free search
    • Freuder, E. 1982. A sufficient condition for backtrack-free search. Journal of The ACM 29(1):24-32.
    • (1982) Journal of the ACM , vol.29 , Issue.1 , pp. 24-32
    • Freuder, E.1
  • 8
    • 49449120803 scopus 로고
    • Consistency in networks of relations
    • Mackworth, A. K. 1977. Consistency in networks of relations. Artificial Intelligence 8(1): 118-126.
    • (1977) Artificial Intelligence , vol.8 , Issue.1 , pp. 118-126
    • Mackworth, A.K.1
  • 9
    • 0016050041 scopus 로고
    • Networks of constraints: Fundamental properties and applications
    • Montanari, U. 1974. Networks of constraints: Fundamental properties and applications. Information Science 7(2):95-132.
    • (1974) Information Science , vol.7 , Issue.2 , pp. 95-132
    • Montanari, U.1
  • 10
    • 84976827271 scopus 로고
    • On the minimality and global consistency of row-convex constraint networks
    • van Beek, P., and Dechter, R. 1995. On the minimality and global consistency of row-convex constraint networks. Journal of The ACM 42(3):543-561.
    • (1995) Journal of the ACM , vol.42 , Issue.3 , pp. 543-561
    • Van Beek, P.1    Dechter, R.2
  • 11
    • 84880855556 scopus 로고    scopus 로고
    • Making AC-3 an optimal algorithm
    • Seattle: IJCAI Inc
    • Zhang, Y., and Yap, R. H. C. 2001. Making AC-3 an optimal algorithm. In Proceedings of IJCAI-01, 316-321. Seattle: IJCAI Inc.
    • (2001) Proceedings of IJCAI-01 , pp. 316-321
    • Zhang, Y.1    Yap, R.H.C.2
  • 12
    • 9444279402 scopus 로고    scopus 로고
    • Consistency and set intersection
    • Acapulco, Mexico: IJCAI Inc
    • Zhang, Y., and Yap, R. H. C. 2003. Consistency and set intersection. In Proceedings of IJCAI-03, 263-268. Acapulco, Mexico: IJCAI Inc.
    • (2003) Proceedings of IJCAI-03 , pp. 263-268
    • Zhang, Y.1    Yap, R.H.C.2


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