Abstract
Tabling has become important to logic programming in part because it opens new application areas, such as model checking, to logic programming techniques. However, the development of new extensions of tabled logic programming is becoming restricted by the formalisms that underly it. Formalisms for tabled evaluations, such as SLG [3], are generally developed with a view to a specific set of allowable operations that can be performed in an evaluation. In the case of SLG, tabling operations are based on a variance relation between atoms. While the set of SLG tabling operations has proven useful for a number of applications, other types of operations, such as those based on a subsumption relation between atoms, can have practical uses. In this paper, SLG is reformulated in two ways: so that it can be parameterized using different sets of operations; and so that a forest of trees paradigm is used. Equivalence to SLG of the new formulation, Extended SLG or SLG X, is shown when the new formalism is parameterized by variant-based operations. In addition, SLG X is also parameterized by subsumption-based operations and shown correct for queries to the well-founded model. Finally, the usefulness of the forest of trees paradigm for motivating tabling optimizations is shown by formalizing the concept of relevance within a tabled evaluation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Alferes, L. M. Pereira, and T. Swift. Well-founded abduction via tabling dual programs. Technical report, SUNY Stony Brook, 1999.
R. Bol and L. Degerstedt. Tabulated resolution for well-founded semantics. Journal of Logic Programming, 38(1):31–55, February 1998.
W. Chen and D. S. Warren. Tabled Evaluation with Delaying for General Logic Programs. JACM, 43(1):20–74, January 1996.
C. Damásio. Paraconsistent Extended Logic Programming with Constraints. PhD thesis, Univ. Nova de Lisboa, 1996.
C. Damásio, W. Nejdl, L. M. Pereira, and M. Schroeder. Model-based diagnosis preferences and strategies representation with logic meta-programming. In Metalogics and Logic Programming, pages 269–311, 1995.
K. Devlin. Fundamentals of Contemporary Set Theory. Springer-Verlag, Berlin Germany, 1980.
J. Freire, P. Rao, K. Sagonas, T. Swift, and D. S. Warren. XSB: A system for efficiently computing the well-founded semantics. In LPNMR, pages 430–440. MIT Press, 1997.
J. Freire, T. Swift, and D. S. Warren. Beyond depth-first: Improving tabled logic programs through alternative scheduling strategies. Journal of Functional and Logic Programming, 1998(3), 1998.
R. Hu. Distributed Tabled Evaluation. PhD thesis, SUNY at Stony Brook, 1997.
J. Liu, L. Adams, and W. Chen. Constructive negation under the well-founded semantics. Technical report, SMU, 1996.
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin Germany, 1984.
Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. Smolka, T. Swift, and D. S. Warren. Efficient model checking using tabled resolution. In Proceedings on the Conference on Automated Verification, pages 143–154, 1997.
R. Ramakrishnan, C. Beeri, and R. Krishnamurthi. Optimizing existential datalog queries. In Proc. of the ACM Symposium on Principles of Database Systems, pages 89–102. ACM, 1988.
K. Sagonas and T. Swift. An abstract machine for tabled execution of fixed-order stratified logic programs. ACM TOPLAS, 20(3):586–635, May 1998.
K. Sagonas, T. Swift, and D. S. Warren. An abstract machine for computing the well-founded semantics. Extended version of article in Joint International Conference and Symposium on Logic Programming, 1996, pp. 274–289, MIT Press.
K. Sagonas, T. Swift, and D. S. Warren. The limits of fixed-order computation. Theoretical Computer Science, 1999. To apperar. Preliminary version apeared in International Workshop on Logic and Databases, LNCS.
T. Swift. Tabling for non-monotonic programming. Annals of Mathematics and Artificial Intelligence. To appear.
H. Tamaki and T. Sato. OLDT resolution with tabulation. In ICLP, pages 84–98. Springer-Verlag, 1986.
A. van Gelder, K.A. Ross, and J.S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. JACM, 38(3):620–650, 1991.
U. Zukowski, S. Brass, and B. Freitag. Improving the alternating fixpoint: The transformation approach. In LPNMR, pages 40–59. Springer-Verlag, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Swift, T. (1999). A New Formulation of Tabled Resolution with Delay. In: Barahona, P., Alferes, J.J. (eds) Progress in Artificial Intelligence. EPIA 1999. Lecture Notes in Computer Science(), vol 1695. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48159-1_12
Download citation
DOI: https://doi.org/10.1007/3-540-48159-1_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66548-9
Online ISBN: 978-3-540-48159-1
eBook Packages: Springer Book Archive