메뉴 건너뛰기




Volumn , Issue , 2004, Pages 149-154

Domain transmutation in constraint satisfaction problems

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; PROBLEM SOLVING; PROGRAM PROCESSORS; ROBUSTNESS (CONTROL SYSTEMS); SET THEORY;

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

References (15)
  • 1
    • 0043231963 scopus 로고
    • Interchangeability preprocessing can improve forward checking search
    • Benson, B. W., and Freuder, E. C. 1992. Interchangeability preprocessing can improve forward checking search. In Proceedings of ECAI-92, 28-30.
    • (1992) Proceedings of ECAI-92 , pp. 28-30
    • Benson, B.W.1    Freuder, E.C.2
  • 3
    • 0031634747 scopus 로고    scopus 로고
    • On the computation of local interchangeability in discrete constraint satisfaction problems
    • Choueiry, B. Y., and Noubir, G. 1998. On the computation of local interchangeability in discrete constraint satisfaction problems. In Proceedings of AAAI-98, 326-333.
    • (1998) Proceedings of AAAI-98 , pp. 326-333
    • Choueiry, B.Y.1    Noubir, G.2
  • 4
    • 0002548421 scopus 로고
    • Extracting constraint satisfaction subproblems
    • Freuder, E. C., and Hubbe, P. D. 1995. Extracting constraint satisfaction subproblems. In Proceedings of IJCAI-95, 548-555.
    • (1995) Proceedings of IJCAI-95 , pp. 548-555
    • Freuder, E.C.1    Hubbe, P.D.2
  • 5
    • 84958062112 scopus 로고
    • Eliminating interchangeable values in constraint satisfaction problems
    • Freuder, E. C. 1991. Eliminating interchangeable values in constraint satisfaction problems. In Proceedings of AAAI-91, 227-233.
    • (1991) Proceedings of AAAI-91 , pp. 227-233
    • Freuder, E.C.1
  • 6
  • 8
    • 0040377583 scopus 로고
    • Exploiting interchangeabilites in constraint satisfaction problems
    • Haselböck, A. 1993. Exploiting interchangeabilites in constraint satisfaction problems. In Proceedings of IJCAI-93, 282-287.
    • (1993) Proceedings of IJCAI-93 , pp. 282-287
    • Haselböck, A.1
  • 9
    • 0026971569 scopus 로고
    • An efficient cross-product representation of the constraint satisfaction problem search space
    • Hubbe, P. D., and Freuder, E. C. 1992. An efficient cross-product representation of the constraint satisfaction problem search space. In Proceedings of AAAI-92, 421-427.
    • (1992) Proceedings of AAAI-92 , pp. 421-427
    • Hubbe, P.D.1    Freuder, E.C.2
  • 10
    • 0003557174 scopus 로고
    • Maximal sets of solutions for constraint satisfaction problems
    • Lesaint, D. 1994. Maximal sets of solutions for constraint satisfaction problems. In Proceedings of ECAI-94, 110-114.
    • (1994) Proceedings of ECAI-94 , pp. 110-114
    • Lesaint, D.1
  • 11
    • 0022677637 scopus 로고
    • Arc and path consistency revisited
    • Mohr, R., and Henderson, T. C. 1986. Arc and path consistency revisited. Artificial Intelligence 28(2):225-233.
    • (1986) Artificial Intelligence , vol.28 , Issue.2 , pp. 225-233
    • Mohr, R.1    Henderson, T.C.2
  • 13
    • 0002146217 scopus 로고
    • Contradicting conventional wisdom in constraint satisfaction
    • Sabin, D., and Freuder, E. C. 1994. Contradicting conventional wisdom in constraint satisfaction. In Proceedings of ECAI-94, 125-129.
    • (1994) Proceedings of ECAI-94 , pp. 125-129
    • Sabin, D.1    Freuder, E.C.2
  • 14
    • 0033325911 scopus 로고    scopus 로고
    • Compiling constraint satisfaction problems
    • Weigel, R., and Fallings, B. V. 1999. Compiling constraint satisfaction problems. Artificial Intelligence 115(2):257-287.
    • (1999) Artificial Intelligence , vol.115 , Issue.2 , pp. 257-287
    • Weigel, R.1    Fallings, B.V.2


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