Download:
|
by Ulrich Zukowski, Burkhard Freitag
Proc. of the Workshop DDLP'96 on Deductive Databases and Logic Programming. 4th Workshop in conjunction with JICSLP'96
http://daisy.fmi.uni-passau.de/publications/ZF96b/paper.ps
Add To MetaCart
Abstract:
We present a version of the alternating fixpoint procedure that is fully incremental. Using ideas of partial evaluation techniques we can compute the well-founded model of logic programs with negation bottom-up without any recomputations. Further extensions of the semantics, e.g. to stable models or disjunctive programs are possible this way. We show how to implement the algorithm efficiently using index-based data structures and describe an extension to handle magic set transformed programs. This set-oriented bottomup algorithm is compatible with the well-known optimizations of deductive databases, e.g. semi-naive fixpoint iteration, and of relational databases, e.g. index techniques that enable the processing of large amounts of data. Thus, a bottom-up alternative to the already known efficient top-down methods for the well-founded semantics seems to be feasible. 1
Citations
|
697
|
The Well-Founded Semantics for General Logic Programs
– Gelder, Ross, et al.
- 1991
|
|
204
|
R.: On the power of Magic
– Beeri, Ramakrishnan
- 1991
|
|
188
|
A.: An alternating fixpoint of logic programs with negation. Journal of computer and system sciences 47
– Gelder
- 1993
|
|
89
|
Modular Stratification and Magic Sets for Datalog Programs with Negation
– Ross
- 1990
|
|
73
|
D.S.: Efficient top-down computation of queries under the well-founded semantics
– Chen, Swift, et al.
- 1995
|
|
63
|
D.S.: Query evaluation under the well-founded semantics
– Chen, Warren
- 1993
|
|
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
|
|
36
|
Controlling the search in bottom-up evaluation
– Ramakrishnan, Srivastava, et al.
- 1992
|
|
27
|
Bottom-up Evaluation and Query Optimization of Well-founded Models
– Kemp, Srivastava, et al.
- 1995
|
|
17
|
Well-founded ordered search
– Stuckey, Sudarshan
- 1993
|
|
16
|
A natural semantics for logic programs with negation
– Dung, Kanchansut
- 1989
|
|
1
|
Computing the well-founded model by partial evaluation
– Brass, Zukowski
- 1996
|
