Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- articleJanuary 2011
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs
Theory and Practice of Logic Programming (TPLP), Volume 11, Issue 1Pages 33–63https://doi.org/10.1017/S1471068410000025Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt termination analysis techniques based on polynomial interpretations—very well ...
- ArticleJuly 2008
Increasing Interpretations
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer MathematicsPages 191–205https://doi.org/10.1007/978-3-540-85110-3_16The paper at hand introduces a refinement of interpretation based termination criteria for term rewrite systems in the dependency pair setting. Traditional methods share the property that--in order to be successful--all rewrite rules must (weakly) ...
- ArticleOctober 2005
Polynomial interpretations as a basis for termination analysis of logic programs
ICLP'05: Proceedings of the 21st international conference on Logic ProgrammingPages 311–325https://doi.org/10.1007/11562931_24This paper introduces a new technique for termination analysis of definite logic programs based on polynomial interpretations. The principle of this technique is to map each function and predicate symbol to a polynomial over some domain of natural ...
- articleMay 2005
Mechanically Proving Termination Using Polynomial Interpretations
Journal of Automated Reasoning (JAUR), Volume 34, Issue 4Pages 325–363https://doi.org/10.1007/s10817-005-9022-xFor a long time, term orderings defined by polynomial interpretations were scarcely used in computer-aided termination proof of TRSs. But recently, the introduction of the dependency pairs approach achieved considerable progress w.r.t. automated ...
