Abstract. We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations studied by Brass and Dix [4, 5]. The transformation approach has been introduced in more detail in [7]. In this paper we present a deeper analysis of its complexity and describe an optimized SCC-oriented evaluation. We show that by our method no more work is done than by the alternating fixpoint procedure [23, 24] and that there are examples where our algorithm is significantly superior. 1
|
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
|
|
200
|
Unfounded sets and well-founded semantics for general logic programs
– Gelder, Ross, et al.
- 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
|
|
182
|
Autoepistemic logic
– Marek, Truszczynski
- 1991
|
|
179
|
Tabled evaluation with delaying for general logic programs
– Chen, Warren
- 1996
|
|
73
|
D.S.: Efficient top-down computation of queries under the well-founded semantics
– Chen, Swift, et al.
- 1995
|
|
54
|
Disjunctive Semantics Based upon Partial and Bottom-Up Evaluation
– Brass, Dix
- 1995
|
|
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
|
|
38
|
Experimenting with nonmonotonic reasoning
– Cholewiński, Marek, et al.
- 1995
|
|
36
|
A Fixpoint Approach to Declarative Semantics of Logic Programs
– Dung, Kanchanasut
- 1989
|
|
35
|
Relating stable models and AI planning domains
– SUBRAHMANIAN, C
- 1995
|
|
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
|
|
20
|
Negation in logic programming: A formalization in constructive logic
– Bry
- 1990
|
|
16
|
Characterizing D-WFS: Confluence and Iterated GCWA
– Brass, Dix
- 1996
|
|
16
|
A natural semantics for logic programs with negation
– Dung, Kanchansut
- 1989
|
|
14
|
Adding flexibility to query evaluation for modularly stratified databases
– Zukowski, Freitag
- 1996
|
|
9
|
Transformation Based Bottom-Up Computation of the Well-Founded Model
– Brass, Zukowski, et al.
- 1997
|
|
7
|
Magic Computation for Well-founded Semantics
– Degerstedt, Nilsson
- 1995
|
|
5
|
Bottom-up query evaluation in extended deductive databases
– Brass
- 1996
|
|
5
|
SLDMagic --- An improved magic set technique
– Brass
- 1996
|
|
4
|
Query-evaluation under the well founded semantics
– Chen, Warren
- 1993
|
|
4
|
The differential fixpoint of general logic programs
– Zukowski, Freitag
- 1996
|
|
