메뉴 건너뛰기




Volumn 12, Issue 1-2, 2001, Pages 117-156

A general framework for automatic termination analysis of logic programs

Author keywords

Abstract interpretation; Constraints; Termination of logic programs

Indexed keywords

AUTOMATIC PROGRAMMING; DIGITAL ARITHMETIC; INTEGER PROGRAMMING; PROGRAM INTERPRETERS; SET THEORY; TREES (MATHEMATICS);

EID: 0034952407     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002000100065     Document Type: Article
Times cited : (49)

References (38)
  • 4
    • 85026855378 scopus 로고
    • Preserving universal temination through unfold/fold
    • Levi, G., Rodríguez-Artalejo, M. (eds.) Lecture Notes in Computer Science, Berlin Heidelberg New York: Springer
    • (1994) Algebraic and Logic Programming , vol.850 , pp. 269-286
    • Bossi, A.1    Cocco, N.2


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