Journal of Symbolic Computation
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Deriving descriptions of possible values of program variables by means of abstract interpretation
Journal of Logic Programming
Generating polynomial orderings
Information Processing Letters
Constraint-based termination analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Acceptability with General Orderings
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Proving Termination of Logic Programs by Exploiting Term Properties
TAPSOFT '91 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD)
Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
Generating Polynomial Orderings for Termination Proofs
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Mechanically Proving Termination Using Polynomial Interpretations
Journal of Automated Reasoning
Termination Analysis of Logic Programs Based on Dependency Graphs
Logic-Based Program Synthesis and Transformation
Proving Termination by Invariance Relations
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Automating Termination Proofs for CHR
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Research Summary: Termination of CHR
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Automated termination proofs for logic programs by term rewriting
ACM Transactions on Computational Logic (TOCL)
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Termination prediction for general logic programs
Theory and Practice of Logic Programming
Automated termination analysis for logic programs by term rewriting
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Polytool: proving termination automatically based on polynomial interpretations
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs
Theory and Practice of Logic Programming
SAT Modulo Linear Arithmetic for Solving Polynomial Constraints
Journal of Automated Reasoning
The dependency triple framework for termination of logic programs
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
A new look at the automatic synthesis of linear ranking functions
Information and Computation
| Hi-index | 0.00 |
This 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 numbers, like it has been done in proving termination of term rewriting systems. Such polynomial interpretations can be seen as a direct generalisation of the traditional techniques in termination analysis of LPs, where (semi-) linear norms and level mappings are used. Our extension generalises these to arbitrary polynomials. We extend a number of standard concepts and results on termination analysis to the context of polynomial interpretations. We propose a constraint based approach for automatically generating polynomial interpretations that satisfy termination conditions.