Efficient Computation of the Well-Founded Model Using Update Propagation

Authors:
Andreas Behrend
Affiliations:
-
Venue:
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Year:
2001

Citing 14
Cited 0

An amateur's introduction to recursive query processing strategies

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The Alexander method-a technique for the processing of recursive axioms in deductive databases

New Generation Computing
A generalization of the differential approach to recursive query evaluation

Journal of Logic Programming
Logic programming as constructivism: a formalization and its application to databases

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive power of stratified logic programs

Information and Computation
On the power of magic

Journal of Logic Programming
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
The alternating fixpoint of logic programs with negation

PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deriving incremental production rules for deductive data

Information Systems
Bottom-up evaluation and query optimization of well-founded models

Theoretical Computer Science
WFS + Branch and Bound = Stable Models

IEEE Transactions on Knowledge and Data Engineering
Integrity Constraints Checking In Deductive Databases

VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Characterizations of the Stable Semantics by Partial Evaluation

LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Transformation-Based Bottom-Up Computation of the Well-Founded Model

NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

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 suffering is avoided by using update propagation rules, generalizing the differential fixpoint computation well-known for stratifiable deductive databases.