Linear Tabulated Resolutions for the Well-Founded Semantics

Authors:
Yi-Dong Shen;Li-Yan Yuan;Jia-Huai You;Neng-Fa Zhou
Affiliations:
-;-;-;-
Venue:
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Year:
1999

Citing 10
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Negation as failure using tight derivations for general logic programs

Journal of Logic Programming
Every logic program has a natural stratification and an iterated least fixed point model

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
A procedural semantics for well-founded negation in logic programs

Journal of Logic Programming
XSB as an efficient deductive database engine

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Tabled evaluation with delaying for general logic programs

Journal of the ACM (JACM)
Parameter passing and control stack management in Prolog implementation revisited

ACM Transactions on Programming Languages and Systems (TOPLAS)
An extended variant of atoms loop check for positive logic programs

New Generation Computing
An abstract machine for tabled execution of fixed-order stratified logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

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.