메뉴 건너뛰기




Volumn 2000-January, Issue , 2000, Pages 104-107

About the use of local consistency in solving CSPs

Author keywords

Constraint optimization; Filtering algorithms; Intelligent networks; Lenses; Power filters; Production; Relational databases

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CONSTRAINED OPTIMIZATION; INTELLIGENT NETWORKS; LENSES; OPTIMIZATION; PRODUCTION;

EID: 77956726430     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TAI.2000.889853     Document Type: Conference Paper
Times cited : (6)

References (11)
  • 1
    • 0020849266 scopus 로고
    • Maintaining knowledge about temporal intervals
    • J. F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26-11:832-843, 1983.
    • (1983) Communications of the ACM , vol.26 , Issue.11 , pp. 832-843
    • Allen, J.F.1
  • 2
    • 84937435863 scopus 로고    scopus 로고
    • La méthode d'avalanche aval: Une méthode énumerative pour sat
    • Lyon France
    • I. Audemard, B. Benhamou, and P. Siegel. La méthode d'avalanche aval: une méthode énumerative pour sat. In JNPC'99, Lyon France, 1999.
    • (1999) JNPC'99
    • Audemard, I.1    Benhamou, B.2    Siegel, P.3
  • 3
    • 84957890248 scopus 로고    scopus 로고
    • Mac and combined heuristics: Two reasons to forsake fc (and cbj?) on hard problems
    • CP'96
    • C. Bessire and J.-C. Rgin. Mac and combined heuristics: Two reasons to forsake fc (and cbj?) on hard problems. In CP'96, LNCS 1118, pages 61-75, 1996.
    • (1996) LNCS , vol.1118 , pp. 61-75
    • Bessire, C.1    Rgin, J.-C.2
  • 4
    • 0002530563 scopus 로고    scopus 로고
    • Some practicable filtering techniques for the constraint satisfaction problems
    • R. Debruyne and C. Bessire. Some practicable filtering techniques for the constraint satisfaction problems. In IJCAI'97, pages 412-417, 1997.
    • (1997) IJCAI'97 , pp. 412-417
    • Debruyne, R.1    Bessire, C.2
  • 5
    • 0023842374 scopus 로고
    • Network-based heuristics for constraint satisfaction problems
    • R. Dechter and J. Pearl. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence, 34:1-38, 1988.
    • (1988) Artificial Intelligence , vol.34 , pp. 1-38
    • Dechter, R.1    Pearl, J.2
  • 7
    • 0000076111 scopus 로고    scopus 로고
    • Heuristics based on unit propagation for satisfiability problems
    • C. M. Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In IJCAI97, pages 366-371, 1997.
    • (1997) IJCAI97 , pp. 366-371
    • Li, C.M.1    Anbulagan2
  • 8
    • 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:95-132, 1974.
    • (1974) Inform. Sci , vol.7 , pp. 95-132
    • Montanari, U.1
  • 9
    • 84959052730 scopus 로고
    • Redundant hidden variables in finite domain constraint problems
    • Constraint processing, Springer-Verlag
    • F. Rossi. Redundant hidden variables in finite domain constraint problems. Constraint processing, Springer-Verlag, LNCS, (923), 1995.
    • (1995) LNCS , Issue.923
    • Rossi, F.1
  • 10
    • 0002146217 scopus 로고
    • Contradicting conventional wisdom in constraint satisfaction
    • D. Sabin and E. Freuder. Contradicting conventional wisdom in constraint satisfaction. In ECAI'94, 1994.
    • (1994) ECAI'94
    • Sabin, D.1    Freuder, E.2
  • 11
    • 0001809968 scopus 로고    scopus 로고
    • Understanding and improving the mac algorithm
    • D. Sabin and E. C. Freuder. Understanding and improving the mac algorithm. In CP'97, 1997.
    • (1997) CP'97
    • Sabin, D.1    Freuder, E.C.2


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