Abstract
Tabled logic programming is receiving increasing attention in the Logic Programming community. It avoids many of the shortcomings of SLD(NF) execution and provides a more flexible and efficient execution mechanism for logic programs. In particular, tabled execution of logic programs terminates more often than execution based on SLD-resolution. One of the few approaches studying termination of tabled logic programs was developed by Decorte et al. They present necessary and sufficient conditions for two notions of universal termination under SLG-resolution, the resolution principle of tabling: quasi-termination and (the stronger notion of) LG-termination. Starting from these necessary and sufficient conditions, we introduce sufficient conditions which are stated fully at the clause level and are easy to automatize. To this end, we use mode and type information: we consider simply moded, well-typed programs and queries. We point out how our termination conditions can be automatized, by extending the recently developed constraint-based automatic termination analysis for SLD-resolution by Decorte and De Schreye.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Apt, K.R., Marchiori, E.: Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing 6(6A), 743–765 (1994)
Apt, K.R., Etalle, S.: On the unification free Prolog programs. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 1–19. Springer, Heidelberg (1993)
Bossi, A., Cocco, N., Fabris, M.: Norms on terms and their use in proving universal termination of a logic program. Theoretical Computer Science 124(2), 297–328 (1994)
Bronsard, F., Lakshman, T., Reddy, U.: A framework of directionality for proving termination of logic programs. In: Apt, K.R. (ed.) Proc. JICSLP, pp. 321–335. MIT Press, Cambridge (1992)
Chen, W., Warren, D.S.: Tabled Evaluation with Delaying for General Logic Programs. J. ACM 43(1), 20–74 (1996)
De Schreye, D., Decorte, S.: Termination of logic programs: the never-ending story. Journal of Logic Programming 19&20, 199–260 (1994)
Decorte, S., De Schreye, D., Leuschel, M., Martens, B., Sagonas, K.: Termination Analysis for Tabled Logic Programming. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol. 1463, pp. 107–123. Springer, Heidelberg (1998)
Decorte, S., De Schreye, D., Vandecasteele, H.: Constraint-based automatic termination analysis for logic programs. ACM TOPLAS (to appear)
Etalle, S., Bossi, A., Cocco, N.: Termination of well-moded programs. Journal of Logic Programming 38(2), 243–257 (1998)
Holst, C.K.: Finiteness Analysis. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol. 523, pp. 473–495. Springer, Heidelberg (1991)
Kanamori, T., Kawamura, T.: OLDT-based abstract interpretation. Journal of Logic Programming 15(1 & 2), 1–30 (1993)
Lloyd, J.: Foundations of logic programming. Springer, Heidelberg (1987)
Plümer, L.: Termination Proofs for Logic Programs. LNCS (LNAI), vol. 446. Springer, Heidelberg (1990)
Tamaki, H., Sato, T.: OLD Resolution with Tabulation. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol. 225, pp. 84–98. Springer, Heidelberg (1986)
Verbaeten, S., De Schreye, D.: Termination analysis of tabled logic programs using mode and type information. Technical Report 277, Department of Computer Science, K.U.Leuven, Available at http://www.cs.kuleuven.ac.be/~sofie
Verbaeten, S., Sagonas, K., De Schreye, D.: Modular termination proofs for Prolog with tabling. Technical report, Department of Computer Science, K.U.Leuven (1999) (accepted for PPDP 1999) , Available at http://www.cs.kuleuven.ac.be/~sofie
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Verbaeten, S., De Schreye, D. (1999). Termination Analysis of Tabled Logic Programs Using Mode and Type Information. In: Middeldorp, A., Sato, T. (eds) Functional and Logic Programming. FLOPS 1999. Lecture Notes in Computer Science, vol 1722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10705424_11
Download citation
DOI: https://doi.org/10.1007/10705424_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66677-6
Online ISBN: 978-3-540-47950-5
eBook Packages: Springer Book Archive