Abstract
In this paper, we describe a methodology for proving termination of logic programs. First, we introduce U-graphs as an abstraction of logic programs and establish that SLDNF-derivations can be realized by instances of paths in the U-graphs. Such a relation enables us to use U-graphs for establishing the universal termination of logic programs. In our method, we associate pre- and post-assertions to the nodes of the graph and ordered assertions to selected edges of the graph. With this as the basis, we develop a simple method for establishing the termination of logic programs. The simplicity/practicality of the method is illustrated through examples.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Barbuti, R., M. Martelli, A Tool to Check the Non-floundering Logic Programs and Goals, First International Workshop on Programming Languages Implementation and Logic Programming, LNCS 348. pp. 58–67. 1988.
Cavedon, L., J. W. Lloyd, A Completeness Theorem for SLDNF-resolution, Tech. Report CS-87-06, University of Bristol, 1987.
Clark, K. L., Nergation as Failure, in Symposium on Logic and Data Bases, (Gallaire, H. and J. Minker Eds.), Plenum Press, 1978.
Dershowitz, N., Termination of Rewriting, J. of Symbolic Computation, (1987) 3, pp. 69–116.
Drabent, W., J. Maluszynski, Inductive Assertion Method for Logic Programs, J. Theoretical Computer Science, 59 (1988) 133–155.
Francez, N., O. Grumberg, S. Katz, A. Pnueli, Proving Termination of Prolog Programs, Proc. of Logics of Programs Conference, Brooklyn NY, LNCS 193, 89–105, 1985.
Floyd, R. M., Assigning Meanings to Programs, Proc. AMS symposium on Applied Mathematics, 19, Providence R.I., 1967.
Heck, N., J. Avenhaus, On Logic Programs with Data-Driven Computations, LNCS No.225, 1986, 433–443.
Kanamori, T., H. Seki, Verification of PROLOG Programs Using an Extension of Execution, Proc. of the Third Intern. Conf. on Logic Programming 1987.
Kunen, K., Signed Data Dependencies in Logic Programs, Computer Science Technical Report 719 University of Wisconsin — Madison, 1987.
Lloyd, J. W., Foundation of Logic Programming,, Springer-Verlag, 1987.
Nilsson, N. J., Priciples of Artificial Intelligence, Springer-Verlag, Berlin, 1982.
Reddy, U. S., On the Relationship between Logic and Functional Languages, in Logic Programming: Functions, Relations, and Equations (Degroot, D. and G. Linstrom, Eds), Prentice-Hall, New Jersey, 1986.
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.
Vasak, T., J. Potter, Characterisation of Terminating Logic Programs, IEEE Sumposium on Logic Programming, 1986.
Wang, B., R. K. Shyamasundar. Proving Termination of Logic Programs: A Perspective in Theoretical Computer Science: Commemorative Volume for Gift Siromoney,. World Scientific. pp. 380–397. 1989.
Wang, B., Ph.D. Thesis, Verification, Termination, and Completeness of Logic Programs, Computer Science Department, The Pennsylvania State University, University Park, PA, August 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, B., Shyamasundar, R.K. (1991). Methodology for proving the termination of logic programs. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020800
Download citation
DOI: https://doi.org/10.1007/BFb0020800
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53709-0
Online ISBN: 978-3-540-47002-1
eBook Packages: Springer Book Archive