OLD resolution with tabulation
Proceedings on Third international conference on 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
Termination proofs for logic programs
Termination proofs for logic programs
Handbook of theoretical computer science (vol. B)
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Abstract interpretation based on OLDT resolution
Journal of Logic Programming
The underlying search for Magic Templates and tabulation
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Reasoning about termination of pure Prolog programs
Information and Computation
Norms on terms and their use in proving universal termination of a logic program
Theoretical Computer Science
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Modular termination proofs for logic and pure PROLOG programs
Advances in logic programming theory
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
Constraint-based termination analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm
Communications of the ACM
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
On the Unification Free Prolog Programs
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Modular Termination Proofs for Prolog with Tabling
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Termination Analysis of Tabled Logic Programs Using Mode and Type Information
FLOPS '99 Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming
BTA Algorithms to Ensure Termination of Off-Line Partial Evaluation
Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Efficiently Generating Efficient Generating Extensions in Prolog
Selected Papers from the Internaltional Seminar on Partial Evaluation
Logic programming revisited: logic programs as inductive definitions
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
A dynamic approach to characterizing termination of general logic programs
ACM Transactions on Computational Logic (TOCL)
On modular termination proofs of general logic programs
Theory and Practice of Logic Programming
Classes of terminating logic programs
Theory and Practice of Logic Programming
Inference of termination conditions for numerical loops in Prolog
Theory and Practice of Logic Programming
On termination of meta-programs
Theory and Practice of Logic Programming
Quasi-terminating logic programs for ensuring the termination of partial evaluation
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Distributed reasoning with ontologies and rules in order-sorted logic programming
Web Semantics: Science, Services and Agents on the World Wide Web
Termination prediction for general logic programs
Theory and Practice of Logic Programming
Improving offline narrowing-driven partial evaluation using size-change graphs
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Fast and accurate strong termination analysis with an application to partial evaluation
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
| Hi-index | 0.00 |
Tabled evaluation is receiving increasing attention in the logic programming community. It avoids many of the shortcomings of SLD execution and provides a more flexible and often considerably more efficient execution mechanism for logic programs. In particular, tabled execution terminates more often than execution based on SLD-resolution. In this article, we introduce two notions of universal termination of logic programming with tabling: quasi-termination and (the stronger notion of) LG-termination. We present sufficient conditions for these two notions of termination, namely quasi-acceptability and LG-acceptability, and we show that these conditions are also necessary in case the selection of tabled predicates meets certain natural criteria. Starting from these conditions, we develop modular termination proofs, i.e., proofs capable of combining termination proofs of separate programs to obtain termination proofs of combined programs. Finally, in the presence of mode information, we state sufficient conditions which form the basis for automatically proving termination in a constraint-based way.