Controlling recursive inference
Artificial Intelligence
OLD resolution with tabulation
Proceedings on Third international conference on logic programming
Efficient loop detection in Prolog using the tortoise-and-hare technique
Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Recursive query processing: the power of logic
Theoretical Computer Science
An analysis of loop checking mechanisms for logic programs
Theoretical Computer Science
Partial evaluation in logic programming
Journal of Logic Programming
The Mixtus approach to automatic partial evaluation of full Prolog
Proceedings of the 1990 North American conference on Logic programming
Towards more efficient loop checks
Proceedings of the 1990 North American conference on Logic programming
Communications of the ACM
Mixtus: an automatic partial evaluator for full Prolog
New Generation Computing
Sound and complete partial deduction with unfolding based on well-founded measures
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Redundancy elimination and loop checks for logic programs
Information and Computation
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
An extended variant of atoms loop check for positive logic programs
New Generation Computing
An abstract approach to some loop detection problems
Fundamenta Informaticae
Linear tabulated resolution based on Prolog control strategy
Theory and Practice of Logic Programming
Eliminating unwanted loops in Prolog
ACM SIGPLAN Notices
A further note on looping in Prolog
ACM SIGPLAN Notices
On eliminating loops in Prolog
ACM SIGPLAN Notices
Detecting Optimal Termination Conditions of Logic Programs
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
A dynamic approach to characterizing termination of general logic programs
ACM Transactions on Computational Logic (TOCL)
Inference of termination conditions for numerical loops in Prolog
Theory and Practice of Logic Programming
Nontermination inference of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning with recursive loops under the PLP framework
ACM Transactions on Computational Logic (TOCL)
A non-termination criterion for binary constraint logic programs
Theory and Practice of Logic Programming
Experiments with Non-Termination Analysis for Java Bytecode
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination prediction for general logic programs
Theory and Practice of Logic Programming
| Hi-index | 5.23 |
Two complete loop checking mechanisms have been presented in the literature for logic programs with functions: OS-check and EVA-check. OS-check is computationally efficient but quite unreliable in that it often misidentifies infinite loops, whereas EVA-check is reliable for a majority of cases but quite expensive. In this paper, we develop a series of new complete loop checking mechanisms, called VAF-checks. The key technique we introduce is the notion of expanded variants, which captures a key structural characteristic of in finite loops. We show that our approach is superior to both OS-check and EVA-check in that it is as efficient as OS-check and as reliable as EVA-check. Copyright 2001 Elsevier Science B.V.