Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Loop checking in logic programming
Loop checking in logic programming
Constraint-based termination analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
cTI: a constraint-based termination inference tool for ISO-Prolog
Theory and Practice of Logic Programming
Nontermination inference of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination analysis of logic programs through combination of type-based norms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving Termination with (Boolean) Satisfaction
Logic-Based Program Synthesis and Transformation
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
Research Summary: Non-termination Analysis of Logic Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Non-termination analysis of logic programs using types
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
| Hi-index | 0.00 |
In this paper, we present a new approach to non-termination analysis of logic programs, based on moded SLDNF-resolution. Moded SLDNF-resolution is a symbolic execution for moded goals, developed for termination prediction. To prove non-termination, we use a complete loop checker to create a finite symbolic derivation tree of a logic program for a moded query. Then, we check if this derivation tree contains an infinite loop, using a new non-termination condition. We implemented this approach and tested it on the benchmark from the Termination Competition of 2007. The results are very satisfactory: our tool is able to prove non-termination and construct non-terminating queries for all non-terminating benchmark programs, and thus, significantly improves on the results of the only other non-termination analyzer, NTI .