메뉴 건너뛰기




Volumn , Issue , 2002, Pages 276-283

Automatic analysis of composite solvers

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER SOFTWARE SELECTION AND EVALUATION; CONSTRAINT THEORY; DATA STRUCTURES; PROBLEM SOLVING; PROGRAM DIAGNOSTICS; SOFTWARE ENGINEERING;

EID: 0036924380     PISSN: 10636730     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAI.2002.1180815     Document Type: Article
Times cited : (3)

References (27)
  • 1
    • 0001751689 scopus 로고    scopus 로고
    • The essence of constraint propagation
    • K. Apt. The Essence of Constraint Propagation. Theoretical Computer Science, 221 (1-2):179-210, 1999.
    • (1999) Theoretical Computer Science , vol.221 , Issue.1-2 , pp. 179-210
    • Apt, K.1
  • 7
    • 0025451308 scopus 로고
    • An introduction to prolog III
    • July
    • A. Colmerauer. An introduction to Prolog III. Communications of the ACM, 33(7):69-90, July 1990.
    • (1990) Communications of the ACM , vol.33 , Issue.7 , pp. 69-90
    • Colmerauer, A.1
  • 8
    • 0000911801 scopus 로고
    • Abstract interpretation and application to logic programs
    • P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming, 13(2-3):103-179, 1992.
    • (1992) Journal of Logic Programming , vol.13 , Issue.2-3 , pp. 103-179
    • Cousot, P.1    Cousot, R.2
  • 10
    • 0012275569 scopus 로고    scopus 로고
    • Interval propagation to reason about sets: Definition and implementation of a practical language
    • Kluwer Academic Publishers
    • C. Gervet. Interval propagation to reason about sets: definition and implementation of a practical language. In Constraints, volume 3, pages 191-244. Kluwer Academic Publishers, 1997.
    • (1997) Constraints , vol.3 , pp. 191-244
    • Gervet, C.1
  • 15
    • 0012272696 scopus 로고    scopus 로고
    • International Computers Limited & Imperial College of London
    • e User Manual (release 5.3), 1996-2000.
    • (1996) e User Manual (release 5.3)
  • 19
    • 0021828305 scopus 로고
    • The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
    • A. K. Mackworth and E. C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Journal of Artificial Intelligence, 25:65-74, 1985.
    • (1985) Journal of Artificial Intelligence , vol.25 , pp. 65-74
    • Mackworth, A.K.1    Freuder, E.C.2
  • 21
    • 0003264983 scopus 로고    scopus 로고
    • The constraint solver collaboration language of BALI
    • In D. M. Gabbay and M. de Rijke, editors; Research Studies Press/Wiley
    • E. Monfroy. The constraint solver collaboration language of BALI. In D. M. Gabbay and M. de Rijke, editors, Frontiers of Combining Systems 2. Research Studies Press/Wiley, 2000.
    • (2000) Frontiers of Combining Systems 2
    • Monfroy, E.1
  • 22
    • 0012220035 scopus 로고    scopus 로고
    • Control-driven constraint propagation
    • Jan.; Special Issue: Coordination Models and Languages in AI
    • E. Monfroy. Control-driven Constraint Propagation. Journal of Applied Artificial Intelligence, 15(1):79-103, Jan. 2001. Special Issue: Coordination Models and Languages in AI.
    • (2001) Journal of Applied Artificial Intelligence , vol.15 , Issue.1 , pp. 79-103
    • Monfroy, E.1


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