메뉴 건너뛰기




Volumn 57, Issue 2-3, 1992, Pages 291-321

A generic arc-consistency algorithm and its specializations

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; CONSTRAINT THEORY; LOGIC PROGRAMMING; SIGNAL FILTERING AND PREDICTION;

EID: 0026941401     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(92)90020-X     Document Type: Article
Times cited : (279)

References (27)
  • 6
  • 10
    • 0025508493 scopus 로고
    • On the parallel complexity of discrete relaxation in constraint satisfaction networks
    • (1990) Artif. Intell. , vol.45 , pp. 275-286
    • Kasif1
  • 11
    • 0002931606 scopus 로고
    • A language and a program for stating and solving combinatorial problems
    • (1978) Artif. Intell. , vol.10 , Issue.1 , pp. 29-127
    • Lauriere1
  • 14
    • 0021828305 scopus 로고
    • The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
    • (1985) Artif. Intell. , vol.25 , pp. 65-74
    • Mackworth1    Freuder2
  • 18
    • 0016050041 scopus 로고
    • Networks of constraints: fundamental properties and applications to picture processing
    • (1974) Inf. Sci. , vol.7 , Issue.2 , pp. 95-132
    • Montanari1
  • 27
    • 0003632388 scopus 로고
    • Generating semantic descriptions from drawings of scenes with shadows
    • MIT, Cambridge, MA
    • (1972) Tech. Rept. AI271
    • Waltz1


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