Abstract
Global SLS-resolution and SLG-resolution are two representative mechanisms for top-down evaluation of the well-founded semantics of general logic programs. Global SLS-resolution is linear but suffers from infinite loops and redundant computations. In contrast, SLG-resolution resolves infinite loops and redundant computations by means of tabling, but it is not linear. The distinctive advantage of a linear approach is that it can be implemented using a simple, efficient stack-based memory structure like that in Prolog. In this paper we present a linear tabulated resolution for the well-founded semantics, which resolves the problems of infinite loops and redundant computations while preserving the linearity. For non-floundering queries, the proposed method is sound and complete for general logic programs with the bounded-term-size property.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bol, R. N., Degerstedt, L.: Tabulated Resolution for the Well-Founded Semantics. Journal of Logic Programming 34:2 (1998) 67–109
Chen, W. D., Swift, T., Warren, D. S.: Efficient Top-Down Computation of Queries under theWell-Founded Semantics. Journal of Logic Programming 24:3 (1995) 161–199
Chen, W. D., Warren, D. S.: Tabled Evaluation with Delaying for General Logic Programs. J. ACM 43:1 (1996) 20–74
Lloyd, J. W.: Foundations of Logic Programming. 2nd edn. Springer-Verlag, Berlin (1987)
Przymusunski, T.: Every Logic Program Has a Natural Stratification and an Iterated Fixed Point Model. In: Proc. of the 8th ACM Symposium on Principles of Database Systems (1989) 11–21
Ross, K.: A Procedural Semantics for Well-Founded Negation in Logic Programs. Journal of Logic Programming 13:1 (1992) 1–22
Sagonas, K., Swift, T., Warren, D. S.: XSB as an Efficient Deductive Database Engine. In: Proc. of the ACM SIGMOD Conference on Management of Data. Minneapolis (1994) 442–453
Sagonas, K., S wift, T., Warren, D. S.: An Abstract Machine for Tabled Execution of Fixed-Order Stratified Logic Programs.ACM Transactions on Programming Languages and Systems 20:3 (1998)
Sagonas, K., Swift, T., Warren, D. S., Freire, J., Rao, P.: The XSB Programmer’s Manual (Version 1.8) (1998)
Shen, Y. D.: An Extended Variant of Atoms Loop Check for Positive Logic Programs.New Generation Computing 15:2 (1997) 317–341
Shen, Y. D., Yuan, L. Y., You, J. H., Zhou, N. F.: Linear Tabulated Resolution Based on Prolog Control Strategy. Submitted for publication (1999)
Van Gelder, A., Ross, K., Schlipf, J.: The Well-Founded Semantics for General Logic Programs. J. ACM 38:3 (1991) 620–650
Van Gelder, A.: Negation as Failure Using Tight Derivations for General Logic Programs. Journal of Logic Programming 6:1&2 (1989) 109–133
Warren, D. H. D.: An Abstract Prolog Instruction Set. Technical Report309, SRI International (1983)
Zhou, N. F.: Parameter Passing and Control Stack Management in Prolog Implementation Revisited. ACM Transactions on Programming Languages and Systems 18:6 (1996) 752–779
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
Shen, YD., Yuan, LY., You, JH., Zhou, NF. (1999). Linear Tabulated Resolution for the Well-Founded Semantics. In: Gelfond, M., Leone, N., Pfeifer, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1999. Lecture Notes in Computer Science(), vol 1730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46767-X_14
Download citation
DOI: https://doi.org/10.1007/3-540-46767-X_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66749-0
Online ISBN: 978-3-540-46767-0
eBook Packages: Springer Book Archive