Abstract
There have been several evaluation mechanisms proposed for computing query answers based on the well-founded semantics, for programs with negation. However, these techniques are costly; in particular, for the special case of modularly stratified programs Ordered Search is more efficient than the general purpose techniques. However, Ordered Search is applicable only to modularly stratified programs. In this paper, we extend Ordered Search to compute the well-founded semantics for all (non-floundering) programs with negation. Our extension behaves exactly like Ordered Search on programs that are modularly stratified, and hence pays no extra cost for such programs.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
I. Balbin and K. Ramamohanarao. A generalization of the differential approach to recursive query evaluation. Journal of Logic Programming, 4(3), September 1987.
Catriel Beeri and Raghu Ramakrishnan. On the power of Magic. In Procs. of the. ACM Symp. on Principles of Database Systems, pages 269–283, Mar. 1987.
N. Bidoit and P. Legay. WELL! An evaluation procedure for all logic programs. In Procs. of the. International Conf. on Database Theory, pages 335–348, Dec. 1990.
Weidong Chen, Terrance Swift and David S. Warren. Efficient Top-Down Computation of Queries under the Well-Founded Semantics Tech. Report 93-CSE-33, Southern Methodist University, Aug. 1993.
Weidong Chen and Davis S. Warren. A goal-oriented approach to computing the well founded semantics. In Procs. of the Joint Int'l Conf. and Symp. on Logic Programming, 589–606, 1992.
Weidong Chen and Davis S. Warren. Query Evaluation under the Well-Founded Semantics. In Procs. of the ACM Symp. on Principles of Database Systems 1993.
David Kemp, Divesh Srivastava, and Peter Stuckey. Magic sets and bottom-up evaluation of well-founded models. In Procs. of the International Logic Programming Symposium, 337–351, 1991.
David Kemp, Divesh Srivastava, and Peter Stuckey. Query restricted bottom-up evaluation of normal logic programs. In Procs. of the Joint. Int.'l Conf. und Symp. on Logic Programming, 288–302, 1992.
Leone, N. and Rullo, P. Safe computation of the well-founded semantics of DATALOG queries. Information Systems 17(1) (1992), 17–31.
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd ed., 1987.
Morishita, S. An alternating fixpoint tailored to magic programs. In Procs. of the 1993 ACM Symp. on Principles of Database Systems, 1993.
Raghu Ramakrishnan. Magic Templates: A spellbinding approach to logic programs. In Procs. of the International Conf. on Logic. Programming, 140–159, 1988.
Raghu Ramakrishnan, Divesh Srivastava, and S. Sudarshan. Controlling the search in bottom-up evaluation. In Joint. Int'l Conf. and Symp. on Logic Programming 1992, 273–287, 1992.
Kenneth A. Ross A procedural semantics for well-founded negation in logic programs. In Procs. of the ACM Symp. on Principles of Database Systems (1989).
Kenneth A. Ross. Modular Stratification and Magic Sets for DATALOG programs with negation. In Procs. of the ACM Symp. on Principles of Database Systems, 161–171, 1990.
Kenneth A. Ross. The Semantics of Deductive Databases. Ph.D. thesis, Department of Computer Science, Stanford University, Aug. 1991.
H. Tamaki and T. Sato. OLD resolution with tabulation. In Procs. of the Third International Conference on Logic Programming (LNCS 225), 84–98, 1986.
A. Van Gelder. The alternating fixpoint of logic programs with negation. In Procs. of the ACM Symp. on Principles of Database Systems, 1–10, 1989.
A. Van Gelder, K. Ross, and J. S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stuckey, P.J., Sudarshan, S. (1993). Well-founded Ordered Search (extended abstract). In: Shyamasundar, R.K. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1993. Lecture Notes in Computer Science, vol 761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57529-4_51
Download citation
DOI: https://doi.org/10.1007/3-540-57529-4_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57529-0
Online ISBN: 978-3-540-48211-6
eBook Packages: Springer Book Archive