Polytool: Proving Termination Automatically Based on Polynomial Interpretations-Reference-Cited by-同舟云学术

Polytool: Proving Termination Automatically Based on Polynomial Interpretations

Published:2007 Issue: Volume: Page:210-218
ISSN:0302-9743
Container-title:Logic-Based Program Synthesis and Transformation
language:
Short-container-title:

Author:

Nguyen Manh Thang,De Schreye Danny

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-71410-1_15

Reference15 articles.

1. The termination problems database (2006), http://www.lri.fr/~marche/wst2004-competition/tpdb.html viewed march 2006

2. 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)

3. Lecture Notes in Computer Science;A. Bossi,1991

4. Contejean, E., Marché, C., Tomás, A.P., Urbain, X.: Mechanically proving termination using polynomial interpretations. Journal of Automated Reasoning (2005)

5. 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)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A practical analysis of non-termination in large logic programs;Theory and Practice of Logic Programming;2013-07

2. Terminyzer: An Automatic Non-termination Analyzer for Large Logic Programs;Practical Aspects of Declarative Languages;2013

3. Non-termination Analysis and Cost-Based Query Optimization of Logic Programs;Web Reasoning and Rule Systems;2012

4. Polytool: Polynomial interpretations as a basis for termination analysis of logic programs;Theory and Practice of Logic Programming;2010-02-25

5. The Dependency Triple Framework for Termination of Logic Programs;Logic-Based Program Synthesis and Transformation;2010