Abstract
In this paper we present a bottom-up algorithm for computing the well-founded model of general normal logic programs by means of range-restricted Datalog ⌝ rules automatically generated from the source program. The drawback of repeated computation of facts from which Van Gelder’s alternating fixpoint procedure is sufiering is avoided by using update propagation rules, generalizing the difierential fixpoint computation well-known for stratifiable deductive databases.
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
Ceri S., Widom J.: Deriving Incremental Production Rules for Deductive Data. Information Systems 19(6): 467–490 (1994).
Balbin I., Ramamohanarao K.: A Generalization of the Differential Approach to Recursive Query Evaluation. JLP 4(3): 259–262 (1987).
Bancilhon F., Ramakrishnan R.: An Amateur’s Introduction to Recursive Query Processing Strategies. SIGMOD Conference 1986: 16–52.
Beeri C., Ramakrishnan R.: On the Power of Magic. JLP 10(1–4): 255–299 (1991).
Brass S., Dix J.: Characterizations of the Stable Semantics by Partial Evaluation. LPNMR 1995: 85–98.
Brass S., Zukowski U., Freitag B.: Transformation-Based Bottom-Up Computation of the Well-Founded Model. NMELP 1996 (LNCS 1216): 171–201.
Bry F.: Logic Programming as Constructivism: A Formalization and its Application to Databases. PODS 1989: 34–50.
Dung P. M., Kanchanasut K.: A Fixpoint Approach to Declarative Semantics of Logic Programs. NACLP 1989: 604–625.
Griefahn, U.: Reactive Model Computation — A Uniform Approach to the Implementation of Deductive Databases. Dissertation, University of Bonn, 1997, http://www.cs.uni-bonn.de/~idb/publications/diss_griefahn.ps.gz
Kemp D., Srivastava D., Stuckey P.: Bottom-Up Evaluation and Query Optimization of Well-Founded Models. Theoretical Computer Science 146(1 & 2): 145–184 (1995).
Kolaitis P.: The Expressive Power of Stratified Programs. Information and Computation 90(1): 50–66 (1991).
Manthey R.: Reflections on Some Fundamental Issues of Rule-based Incremental Update Propagation. DAISD 1994: 255–276.
Olivé A.: Integrity Constraints Checking In Deductive Databases. VLDB 1991: 513–523.
Rohmer J., Lescoeur R., Kerisit J.-M.: The Alexander Method-A Technique for The Processing of Recursive Axioms in Deductive Databases. New Generation Computing 4(3): 273–285 (1986).
Subrahmanian V. S., Nau D. S., Vago C.: WFS + Branch and Bound = Stable Models. TKDE 7(3): 362–377 (1995).
Van Gelder A.: The Alternating Fixpoint of Logic Programs with Negation. JCSS 47(1): 185–221 (1993).
Van Gelder A., Ross K., Schlipf J.: The Well-Founded Semantics for General Logic Programs. JACM 38(3): 620–650 (1991).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Behrend, A. (2001). Efficient Computation of the Well-Founded Model Using Update Propagation. In: Nieuwenhuis, R., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2001. Lecture Notes in Computer Science(), vol 2250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45653-8_29
Download citation
DOI: https://doi.org/10.1007/3-540-45653-8_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42957-9
Online ISBN: 978-3-540-45653-7
eBook Packages: Springer Book Archive