Theory of linear and integer programming
Theory of linear and integer programming
Termination detection in logic programs using argument sizes (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multiple specialization using minimal-function graph semantics
Journal of Logic Programming
On proving left termination of constraint logic programs
ACM Transactions on Computational Logic (TOCL)
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Halting Problem of One Binary Horn Clause is Undecidable
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Inference of termination conditions for numerical loops in Prolog
Theory and Practice of Logic Programming
Recurrence with affine level mappings is p-time decidable for clp$({\mathbb r})$
Theory and Practice of Logic Programming
A new look at the automatic synthesis of linear ranking functions
Information and Computation
| Hi-index | 0.00 |
Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to the fact that some of the recent approaches to termination of logic programs abstract the input program to a binary CLP program and conclude termination of the input program from termination of the abstracted program. In this paper we introduce a class of binary CLP programs such that their termination can be proved by using linear level mappings. We show that membership to this class is decidable and present a decision procedure. Further, we extend this class to programs such that their termination proofs require a combination of linear functions. In particular we consider as level mappings tuples of linear functions and piecewise linear functions.