Termination Proofs for Logic Programs with Tabling

Simple item page
dc.creatorVerbaeten, Sofie
dc.creatorDe Schreye, Danny
dc.creatorSagonas, Konstantinos
dc.date2000-03-09
dc.date.accessioned2026-07-07T03:16:02Z
dc.date.available2026-07-07T03:16:02Z
dc.descriptionTabled logic programming 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 extremely efficient execution mechanism for logic programs. In particular, tabled execution of logic programs 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 tabling is well-chosen. Starting from these conditions, we give 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.
dc.description48 pages, 6 figures, submitted to ACM Transactions on Computational Logic (TOCL)
dc.identifierhttps://arxiv.org/abs/cs/0003045
dc.identifierhttp://arxiv.org/abs/cs/0003045
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30205
dc.subjectLogic in Computer Science
dc.subjectI.2.2; I.2.3; D.1.6
dc.titleTermination Proofs for Logic Programs with Tabling
dc.typetext

Files

Collections

arXiv