SLD resolution with negation as finite failure (SLDNF) reflects the procedural interpretation of predicate calculus as a programming language and forms the computational basis for Prolog systems. Despite its advantages in stack-based memory management, SLDNF is often not appropriate for query evaluation for three reasons: a) it may not terminate due to infinite positive recursion; b) it may not terminate due to infinite recursion through negation; and c) it may repeatedly evaluate the same literal in a rule body, leading to unacceptable performance. We address all three problems for goal-oriented query evaluation of general logic programs by presenting tabled evaluation with delaying, called SLG resolution. It has three distinctive features: (i) SLG resolution is a partial deduction procedure, consisting of six fundamental transformations. Each query is transformed step by step into a set of answers. The use of transformations separates logical issues of query evaluation from procedura...
|
1626
|
Foundations of Logic Programming
– Lloyd
- 1984
|
|
1122
|
The Stable Model Semantics for Logic Programming
– GELFOND, LIFSCHITZ
- 1988
|
|
773
|
Negation as failure
– Clark
- 1978
|
|
685
|
The Well-Founded Semantics for General Logic Programs
– Gelder, Ross, et al.
- 1991
|
|
604
|
The semantics of Predicate Logic as a Programming Language
– Emden, Kowalski
- 1976
|
|
542
|
Towards a Theory of Declarative Knowledge
– Apt, Blair, et al.
- 1988
|
|
441
|
The complexity of relational query languages
– Vardi
- 1982
|
|
292
|
An efficient unification algorithm
– Martelli, Montanari
- 1982
|
|
246
|
Magic sets and other strange ways to implement logic programs
– Bancilhon, Maier, et al.
- 1986
|
|
225
|
On the Declarative Semantics of Deductive Databases and Logic Programs
– Rondogiannis, Przymusinski, et al.
- 1988
|
|
213
|
Partial Evaluation in Logic Programming
– Lloyd, Shepherdson
- 1991
|
|
205
|
On the power of magic
– BEERI, R
- 1987
|
|
186
|
XSB as an Efficient Deductive Database Engine
– Sagonas, Swift, et al.
- 1994
|
|
178
|
OLDT resolution with tabulation
– Tamaki, Sato
- 1986
|
|
168
|
Contributions to the Theory of Logic Programming
– Apt, Emden
- 1982
|
|
165
|
Autoepistemic logic
– Marek, Truszczyński
- 1991
|
|
120
|
Well-founded Semantics Coincides With Three-Valued Stable Semantics
– Przymusinski
- 1990
|
|
119
|
Constructive Negation Based on the Completed Database
– Chan
- 1988
|
|
118
|
Every Logic Program has a Natural Stratification and an Iterated Fixed Point Model
– Przymusinski
- 1989
|
|
116
|
Negation as failure using tight derivations for general logic programs
– Gelder
- 1988
|
|
111
|
Magic Templates: A spellbinding approach to logic programming
– Ramakrishnan
- 1988
|
|
111
|
Constructive Negation for Constraint Logic Programming
– Stuckey
- 1991
|
|
70
|
Ecient top-down computation of queries under the well-founded semantics
– Chen, Swift
- 1995
|
|
62
|
Recursive query processing: the power of logic
– Vieille
- 1987
|
|
57
|
On the declarative and procedural Semantics of logic Programs
– Przymusinski
- 1989
|
|
54
|
Extension tables: Memo relations in logic programming
– Dietrich
- 1987
|
|
53
|
Query evaluation in recursive databases: Bottom-up and top-down reconciled
– Bry
|
|
49
|
A procedural semantics for well-founded negation in logic programs
– Ross
- 1992
|
|
47
|
Tabulated resolution for well founded semantics
– Bol, Degerstedt
- 1993
|
|
46
|
Computing of Stable Models and its Integration with Logical Query Processing
– Chen, Warren
- 1995
|
|
45
|
Weakly perfect model semantics for logic programs
– Przymusinska, Przymusinski
- 1988
|
|
41
|
On the power of Alexander templates
– Seki
- 1989
|
|
37
|
A goal--oriented approach to computing well-- founded semantics
– Chen, Warren
- 1992
|
|
32
|
Magic Sets and Bottom-Up Evaluation of Well-Founded Models
– Kemp, Stuckey, et al.
- 1991
|
|
32
|
Controlling the search in bottom-up evaluation
– Ramakrishnan, Srivastava, et al.
- 1992
|
|
25
|
A database-complete proof procedure based upon sld-resolution
– Vieille
- 1987
|
|
24
|
On constructive negation in logic programming
– Przymusinski
- 1989
|
|
23
|
An alternating fixpoint tailored to magic programs
– Morishita
- 1993
|
|
22
|
A query evaluation method for stratified programs under the extended CWA
– Seki, Itoh
- 1988
|
|
20
|
Efficient bottom-up computation of queries on stratified databases
– Balbin, Port, et al.
|
|
19
|
Completeness of a top-down query evaluation procedure for stratified databases
– Kemp, Topor
- 1988
|
|
17
|
Query restricted bottom-up evaluation of normal logic programs
– Kemp, Stuckey, et al.
- 1992
|
|
15
|
Towards a Programming Methodology Founded on Partial Deduction
– Komorowski
- 1990
|
|
14
|
Well-founded ordered search
– Stuckey, Sudarshan
- 1993
|
|
13
|
MyExperience: A System for
– Froehlich, Chen, et al.
- 2007
|
|
13
|
A portable method of integrating slg resolution into prolog systems
– Ramesh, Chen
- 1994
|
|
11
|
The Semantics of Deductive Databases
– Ross
- 1991
|
|
8
|
An evaluation procedure for all logic programs
– Bidoit, Legay
- 1990
|
|
5
|
Constructive negation of general logic programs. submitted
– Chen
- 1993
|
|
