Proc. of the first international conference on Rewriting techniques and applications
Rewrite method for theorem proving in first order theory with equality
Journal of Symbolic Computation
Termination proofs for logic programs
Termination proofs for logic programs
Deriving descriptions of possible values of program variables by means of abstract interpretation
Journal of Logic Programming
Norms on terms and their use in proving universal termination of a logic program
Theoretical Computer Science
From logic programming to Prolog
From logic programming to Prolog
Termination analysis: some practical properties of the norm and level mapping space
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Constraint-based termination analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving termination with multiset orderings
Communications of the ACM
On the Unification Free Prolog Programs
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Automatically Proving Termination Where Simplification Orderings Fail
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Termination of Logic Programs Using Semantic Unification
LOPSTR '95 Proceedings of the 5th International Workshop on Logic Programming Synthesis and Transformation
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
On Termination of Logic Programs with Floating Point Computations
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
| Hi-index | 0.00 |
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general term-orderings (instead of level mappings), like it is done in transformational approaches to logic program termination analysis, but that we apply these orderings directly to the logic program and not to the term-rewrite system obtained through some transformation. We define some variants of acceptability, based on general term-orderings, and show how they are equivalent to LD-termination. We develop a demand driven, constraint-based approach to verify these acceptability-variants. The advantage of the approach over standard acceptability is that in some cases, where complex level mappings are needed, fairly simple term-orderings may be easily generated. The advantage over transformational approaches is that it avoids the transformation step all together.