Skip to main content
SpringerLink
Log in

Towards a characterization of termination of logic programs

  • Static Analysis
  • Conference paper
  • First Online:
Programming Language Implementation and Logic Programming (PLILP 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 456))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K. R., R. N. Bol, and J. W. Klop, On the Safe Termination of PROLOG programs, Proc. of the Sixth Intern. Conf. on Logic Programming, pp. 353–368, 1989.

    Google Scholar 

  2. Apt, R. K., H. Blair, and A. Walker, Towards a Theory of Declarative Knowledge, in Foundations of Deductive Databases and Logic Programming, (Minker, J. Ed.), pp. 89–148, Morgan Kaufmann, Los Altos, 1988

    Google Scholar 

  3. Barbuti, R. and M. Martelli, A Tool to Check the Non-floundering Logic Programs and Goals, Programming Languages Implementation and Logic Programming, LNCS 348. pp. 58–67. 1988.

    Google Scholar 

  4. Cavedon, L. and J. W. Lloyd, A Completeness Theorem for SLDNF-resolution, Tech. Report CS-87-06, University of Bristol, 1987.

    Google Scholar 

  5. Cavedon, L., Continuity, Consistency, and Completeness Properties for Logic Programs, Proc. of the Sixth Intern. Conf. on Logic Programming, pp. 353–368, 1989.

    Google Scholar 

  6. Clark, K. L., Negation as Failure, in Symposium on Logic and Data Bases, (Gallaire, H. and J. Minker Eds.), Plenum Press, 1978.

    Google Scholar 

  7. Dershowitz, N., Termination of Rewriting, J. of Symbolic Computation, (1987) 3, pp. 69–116.

    Google Scholar 

  8. Francez, N., O. Grumberg, S. Katz, and A. Pnueli, Proving Termination of Prolog Programs, Proc. of Logics of Programs Conference, Brooklyn NY, LNCS 193, 89–105, 1985.

    Google Scholar 

  9. Heck, N. and J. Avenhaus, On Logic Programs with Data-Driven Computations, LNCS No.225, 1986, 433–443.

    Google Scholar 

  10. Kunen, K., Signed Data Dependencies in Logic Programs, Computer Science Technical Report 719 University of Wisconsin-Madison, 1987.

    Google Scholar 

  11. Lloyd, J. W., Foundation of Logic Programming,, Springer-Verlag, 1987.

    Google Scholar 

  12. Nilsson, N. J., Priciples of Artificial Intelligence, Springer-Verlag, Berlin, 1982.

    Google Scholar 

  13. Shepherdson, J. C., Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption, J. Logic Programming, 1984:1:51–79.

    Google Scholar 

  14. Shepherdson, J. C., Negation as Failure. II, J. Logic Programming, 1985:3:185–202.

    Google Scholar 

  15. Ullman, J. D. and A. van Gelder, Efficient Tests for Top-Down Termination of Logical Rules, JACM, Vol. 35, No. 2, April 1988, pp. 69–116.

    Google Scholar 

  16. Vasak, T., J. Potter, Characterisation of Terminating Logic Programs, IEEE Sumposium on Logic Programming, 1986.

    Google Scholar 

  17. Wang, B. and R. K. Shyamasundar, Methodolgy for Proving Termination of Logic Programs, Tech. Report CS-90-19, Pennsylvania State University, 1990.

    Google Scholar 

  18. Wang, B. and R. K. Shyamasundar, Static Analysis of Logic Programs for Characterization of Termination of Logic Programs, Tech. Report CS-90-20, Pennsylvania State University, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Dept., Penn State University, 16802, PA

    B. Wang

  2. TATA Institute of Foundamantal Research, Bombay, India

    R. K. Shyamasundar

Authors
  1. B. Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. K. Shyamasundar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierre Deransart Jan Maluszyński

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, B., Shyamasundar, R.K. (1990). Towards a characterization of termination of logic programs. In: Deransart, P., Maluszyński, J. (eds) Programming Language Implementation and Logic Programming. PLILP 1990. Lecture Notes in Computer Science, vol 456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024186

Download citation

  • DOI: https://doi.org/10.1007/BFb0024186

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53010-7

  • Online ISBN: 978-3-540-46298-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation