. We present a bottom-up algorithm for the computation of the wellfounded model of non-disjunctive logic programs. Our method is based on the elementary program transformations studied by Brass and Dix [BD94, BD97, BD98a]. However, their "residual program " can grow to exponential size, whereas for function-free programs our "program remainder " is always polynomial in the size of the extensional database (EDB). As in the SLG-resolution of Chen and Warren [CW93, CW96, CSW95], we do not only delay negative but also positive literals if they depend on delayed negative literals. When disregarding goal-directedness, which needs additional concepts, our approach can be seen as a simplified bottom-up version of SLG-resolution applicable to range-restricted Datalog programs. Since our approach is also closely related to the alternating fixpoint procedure [VG89, VG93], it can possibly serve as a basis for an integration of the resolution-based, fixpoint-based, and transformation-based evaluation methods.
|
1126
|
The Stable Model Semantics for Logic Programming
– Gelfond, Lifschitz
- 1988
|
|
697
|
The Well-Founded Semantics for General Logic Programs
– Gelder, Ross, et al.
- 1991
|
|
640
|
Depth-First Search and Linear Graph Algorithms
– Tarjan
- 1972
|
|
599
|
Data Structures and Algorithms
– Aho, Hopcroft, et al.
- 1983
|
|
325
|
Bilattices and the semantics of logic programming
– Fitting
- 1991
|
|
188
|
A.: An alternating fixpoint of logic programs with negation. Journal of computer and system sciences 47
– Gelder
- 1993
|
|
185
|
D.S.: XSB as an efficient deductive database engine
– Sagonas, Swift, et al.
- 1994
|
|
179
|
Tabled evaluation with delaying for general logic programs
– Chen, Warren
- 1996
|
|
138
|
The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae
– Przymusinski
- 1990
|
|
88
|
Encoding planning problems in nonmonotonic logic programs
– Dimopoulos, Koehler, et al.
- 1997
|
|
73
|
D.S.: Efficient top-down computation of queries under the well-founded semantics
– Chen, Swift, et al.
- 1995
|
|
61
|
On the declarative and procedural semantics of logic programs
– Przymusinski
- 1989
|
|
53
|
Mixed integer programming methods for computing nonmonotonic deductive databases
– Bell, Nerode, et al.
- 1994
|
|
53
|
Tabulated resolution for well-founded semantics
– Bol, Degerstadt
- 1993
|
|
52
|
Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation
– Brass, Dix
- 1999
|
|
50
|
A Classification-Theory of Semantics of Normal Logic Programs
– Dix
- 1995
|
|
49
|
Characterizations of the Disjunctive Stable Semantics by Partial Evaluation
– Brass, Dix
- 1997
|
|
44
|
Linear-time algorithms for testing the satis of propositional Horn formulae
– Dowling, Gallier
- 1984
|
|
41
|
Logic Programming as Constructivism: A Formalization and its Application to Databases
– Bry
- 1989
|
|
38
|
A general approach to bottom-up computation of disjunctive semantics
– Brass, Dix
- 1995
|
|
36
|
Controlling the search in bottom-up evaluation
– Ramakrishnan, Srivastava, et al.
- 1992
|
|
34
|
Characterizations of the Disjunctive Well-founded Semantics: Confluent Calculi and Iterated GCWA
– Brass, Dix
- 1998
|
|
34
|
Three-Valued Non-Monotonic Formalisms and Semantics of Logic Programs
– Przymusinski
- 1991
|
|
32
|
XSB: A system for efficiently computing well-founded semantics
– Rao, Sagonas, et al.
- 1997
|
|
31
|
Magic Sets and Bottom-Up Evaluation of Well-Founded Models
– Kemp, Stuckey, et al.
- 1991
|
|
30
|
XSB as an ecient deductive database engine
– Sagonas, Swift, et al.
- 1994
|
|
27
|
A Disjunctive Semantics Based on Unfolding and Bottom-up Evaluation
– Brass, Dix
- 1994
|
|
27
|
Bottom-up Evaluation and Query Optimization of Well-founded Models
– Kemp, Srivastava, et al.
- 1995
|
|
26
|
A Logic Language for Deductive Databases and its Implementation
– LOLA
- 1991
|
|
24
|
Transformation-based bottom-up computation of the well-founded model
– Brass, Dix, et al.
- 2001
|
|
23
|
Implementing stable semantics by linear programming
– Bell, Nerode, et al.
- 1993
|
|
22
|
Computing well-founded semantics faster
– Berman, Schlipf, et al.
- 1995
|
|
20
|
Negation in logic programming: A formalization in constructive logic
– Bry
- 1990
|
|
14
|
Adding flexibility to query evaluation for modularly stratified databases
– Zukowski, Freitag
- 1996
|
|
12
|
The alternating of logic programs with negation
– Gelder
- 1989
|
|
8
|
Improving the Alternating Fixpoint: The Transformation Approach
– Zukowski, Brass, et al.
- 1997
|
|
8
|
Well-Founded Ordered Search: Goal-Directed Bottom-Up Evaluation of Well-Founded Models
– Stuckey, Sudarshan
- 1997
|
|
4
|
Query-evaluation under the well founded semantics
– Chen, Warren
- 1993
|
|
4
|
The differential fixpoint of general logic programs
– Zukowski, Freitag
- 1996
|
|
4
|
Branch and Bound = Stable Models
– WFS
- 1995
|
|
3
|
Minh Dung and Kanchana Kanchansut. A fixpoint approach to declarative semantics of logic programs
– Phan
- 1989
|
|
3
|
Marek and Miroslaw Truszczynski. Autoepistemic logic
– Wiktor
- 1991
|
|
3
|
Minh Dung and Kanchana Kanchansut. A natural semantics of logic programs with negation
– Phan
- 1989
|
|
1
|
Minh Dung and Kanchana Kanchansut. A approach to declarative semantics of logic programs
– Phan
- 1989
|
|
1
|
An extension of Van Gelder's alternating to magic programs
– Morishita
- 1996
|
|
1
|
Niemela and Patrik Simons. Ecient implementation of the wellfounded and stable model semantics
– Ilka
- 1996
|
|
1
|
Improving the alternating xpoint: The transformation approach
– Zukowski, Brass, et al.
- 1997
|
|
1
|
Adding to query evaluation for modularly strati databases
– Zukowski, Freitag
|
|
1
|
The dierential of general logic programs
– Zukowski, Freitag
|
