메뉴 건너뛰기




Volumn 2477, Issue , 2002, Pages 509-525

Detecting optimal termination conditions of logic programs

Author keywords

[No Author keywords available]

Indexed keywords

ATOMS; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE; STATIC ANALYSIS;

EID: 23044534516     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45789-5_35     Document Type: Conference Paper
Times cited : (7)

References (24)
  • 1
    • 0003400084 scopus 로고    scopus 로고
    • From Logic Programming to Prolog
    • K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997.
    • (1997) Prentice Hall
    • Apt, K.R.1
  • 2
    • 0003144205 scopus 로고
    • Modular termination proofs for logic and pure Prolog programs
    • Oxford University Press
    • K. R. Apt and D. Pedreschi. Modular termination proofs for logic and pure Prolog programs. In G. Levi, editor, Advances in Logic Programming Theory, pages 183–229. Oxford University Press, 1994.
    • (1994) G. Levi, Editor, Advances in Logic Programming Theory , pp. 183-229
    • Apt, K.R.1    Pedreschi, D.2
  • 3
    • 84976837285 scopus 로고
    • Contributions to the theory of logic programming
    • K. R. Apt and M. H. Van Emden. Contributions to the theory of logic programming. Journal of the ACM, 29(3):841–862, 1982.
    • (1982) Journal of the ACM , vol.29 , Issue.3 , pp. 841-862
    • Apt, K.R.1    Van Emden, M.H.2
  • 4
    • 84858906826 scopus 로고    scopus 로고
    • Termination of logic programs using semantic unification
    • of Lecture Notes in Computer Science. Springer-Verlag, Berlin
    • T. Arts and H. Zantema. Termination of logic programs using semantic unification. In Logic Program Synthesis and Transformation, volume 1048 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1996.
    • Logic Program Synthesis and Transformation , vol.1048 , pp. 1996
    • Arts, T.1    Zantema, H.2
  • 6
    • 0002319293 scopus 로고
    • A general criterion for avoiding infinite unfolding during partial deduction
    • M. Bruynooghe, D. De Schreye, and B. Martens. A general criterion for avoiding infinite unfolding during partial deduction. New Generation Computing, 11(1):47–79, 1992.
    • (1992) New Generation Computing , vol.11 , Issue.1 , pp. 47-79
    • Bruynooghe, M.1    De Schreye, D.2    Martens, B.3
  • 7
    • 0032678119 scopus 로고    scopus 로고
    • A semantic basis for the termination analysis of logic programs
    • M. Codish and C. Taboch. A semantic basis for the termination analysis of logic programs. Journal of Logic Programming, 41(1):103–123, 1999.
    • (1999) Journal of Logic Programming , vol.41 , Issue.1 , pp. 103-123
    • Codish, M.1    Taboch, C.2
  • 8
    • 0024910953 scopus 로고
    • On the existence of nonterminating queries for a restricted class of Prolog-clauses
    • D. De Schreye, M. Bruynooghe, and K. Verschaetse. On the existence of nonterminating queries for a restricted class of Prolog-clauses. Artificial Intelligence, 41:237–248, 1989.
    • (1989) Artificial Intelligence , vol.41 , pp. 237-248
    • De Schreye, D.1    Bruynooghe, M.2    Verschaetse, K.3
  • 11
    • 85029539574 scopus 로고
    • Halting problem of one binary Horn clause is undecidable
    • Springer-Verlag, Proc. of STACS’93
    • P. Devienne, P. Lebegue, and J-C. Routier. Halting problem of one binary Horn clause is undecidable. In LNCS, volume 665, pages 48–57. Springer-Verlag, 1993. Proc. of STACS’93.
    • (1993) LNCS , vol.665 , pp. 48-57
    • Devienne, P.1    Lebegue, P.2    Routier, J.-C.3
  • 14
    • 0011156298 scopus 로고    scopus 로고
    • Finite failure is and-compositional
    • R. Gori and G. Levi. Finite failure is and-compositional. Journal of Logic and Computation, 7(6):753–776, 1997.
    • (1997) Journal of Logic and Computation , vol.7 , Issue.6 , pp. 753-776
    • Gori, R.1    Levi, G.2
  • 15
    • 85032862133 scopus 로고
    • Partial evaluation as a means for inferencing data structures in an applicative language: A theory and implementation in the case of Prolog
    • H. J. Komorowski. Partial evaluation as a means for inferencing data structures in an applicative language: a theory and implementation in the case of Prolog. In Proc. of the 9th POPL, pages 255–267, 1982.
    • (1982) Proc. of the 9Th POPL , pp. 255-267
    • Komorowski, H.J.1
  • 17
    • 0040622366 scopus 로고    scopus 로고
    • Inferring left-terminating classes of queries for constraint logic programs by means of approximations
    • M. J. Maher, editor, MIT Press
    • F. Mesnard. Inferring left-terminating classes of queries for constraint logic programs by means of approximations. In M. J. Maher, editor, Proc. of the 1996 Joint Intl. Conf. and Symp. on Logic Programming, pages 7–21. MIT Press, 1996.
    • (1996) Proc. of the 1996 Joint Intl. Conf. and Symp. on Logic Programming , pp. 7-21
    • Mesnard, F.1
  • 19
    • 84890053639 scopus 로고    scopus 로고
    • Applying static analysis techniques for inferring termination conditions of logic programs
    • P. Cousot, editor, Springer-Verlag, Berlin
    • F. Mesnard and U. Neumerkel. Applying static analysis techniques for inferring termination conditions of logic programs. In P. Cousot, editor, Static Analysis Symposium, volume 2126 of Lecture Notes in Computer Science, pages 93–110. Springer-Verlag, Berlin, 2001.
    • (2001) Static Analysis Symposium, Volume 2126 of Lecture Notes in Computer Science , pp. 93-110
    • Mesnard, F.1    Neumerkel, U.2
  • 22
    • 0035817897 scopus 로고    scopus 로고
    • Loops checks for logic programs with functions
    • Y-D. Shen, L-Y. Yuan, and J-H. You. Loops checks for logic programs with functions. Theoretical Computer Science, 266(1-2):441–461, 2001.
    • (2001) Theoretical Computer Science , vol.266 , Issue.1-2 , pp. 441-461
    • Shen, Y.-D.1    Yuan, L.-Y.2    You, J.-H.3
  • 23
    • 0031199408 scopus 로고    scopus 로고
    • An abstract approach to some loop detection problems
    • D. Skordev. An abstract approach to some loop detection problems. Fundamenta Informaticae, 31:195–212, 1997.
    • (1997) Fundamenta Informaticae , vol.31 , pp. 195-212
    • Skordev, D.1


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