Abstract
In this system description, we present Polytool, a fully automated system for proving left-termination of definite logic programs (LPs). The aim of Polytool is to extend the power of existing termination analysers by using well-founded orders based on polynomial interpretations. This is a direct extension of the well-founded orders based on (semi-)linear level mappings and norms that are used in most of the existing LP termination analysis systems.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
The termination problems database (2006), http://www.lri.fr/~marche/wst2004-competition/tpdb.html viewed march 2006
Apt, K.R., Pedreschi, D.: Studies in pure prolog: Termination. In: Lloyd, J.W. (ed.) Proceedings Symposium in Computational Logic, pp. 150–176. Springer, Heidelberg (1990)
Bossi, A., Cocco, N., Fabris, M.: Proving termination of logic programs by exploiting term properties. In: Abramsky, S. (ed.) TAPSOFT 1991, CCPSD 1991, and ADC-Talks 1991. LNCS, vol. 494, pp. 153–180. Springer, Heidelberg (1991)
Contejean, E., Marché, C., Tomás, A.P., Urbain, X.: Mechanically proving termination using polynomial interpretations. Journal of Automated Reasoning (2005)
De Koninck, L., Schrijvers, T., Demoen, B.: INCLP(R) - Interval-based nonlinear constraint logic programming over the reals. In: Fink, M., Tompits, H., Woltran, S. (eds.) Workshop on Logic Programming, pp. 91–100 (2006)
Decorte, S., De Schreye, D., Vandecasteele, H.: Constraint based automatic termination analysis of logic programs. ACM Transactions on Programming Languages and Systems 21(6), 1137–1195 (1999)
Hong, H., Jakus, D.: Testing positiveness of polynomials. Journal of Automated Reasoning 21(1), 23–38 (1998)
Janssens, G., Bruynooghe, M.: Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming 13(2-3), 205–258 (1992)
Nguyen, M.T., De Schreye, D.: Polynomial interpretations as a basis for termination analysis of logic programs. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 311–325. Springer, Heidelberg (2005)
Ohlebusch, E., Claves, C., Marché, C.: Talp: A tool for the termination analysis of logic programs. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol. 1833, pp. 270–273. Springer, Heidelberg (2000)
Serebrenik, A.: Termination Analysis of Logic Programs. PhD thesis, Department of Computer Science, K.U.Leuven, Belgium (2003)
Serebrenik, A., De Schreye, D.: Hasta-La-Vista: Termination analyser for logic programs. In: Mesnard, F., Serebrenik, A. (eds.) 6th International Workshop on Termination (WLPE’03), pp. 60–74 (2003)
Steinbach, J.: Proving polynomials positive. In: Shyamasundar, R.K. (ed.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 652, pp. 18–20. Springer, Heidelberg (1992)
Steinbach, J.: On the complexity of simplification orderings. Technical Report SR-93-18 (SFB), SEKI University of Kaiserslautern (1993)
Taboch, C., Genaim, S., Codish, M.: Terminweb: Semantic based termination analyser for logic programs (2002), http://www.cs.bgu.ac.il/~mcodish/terminweb
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Nguyen, M.T., De Schreye, D. (2007). Polytool: Proving Termination Automatically Based on Polynomial Interpretations. In: Puebla, G. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 2006. Lecture Notes in Computer Science, vol 4407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71410-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-71410-1_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71409-5
Online ISBN: 978-3-540-71410-1
eBook Packages: Computer ScienceComputer Science (R0)