In recent years, much work has been directed towards evaluating logic programs and queries on deductive databases by using an iterative bottom-up fixpoint computation. The resulting techniques offer an attractive alternative to Prolog-style top-down evaluation in several situations. They are sound and complete for positive Horn clause programs, are well-suited to applications with large volumes of data (facts), and can support a variety of extensions to the standard logic programming paradigm. We present the basics of database query evaluation and logic programming evaluation, and then discuss bottom-up fixpoint evaluation. We discuss an approach based upon using a program transformation ("Magic Templates") to restrict search, followed by fixpoint computation using a technique ("Semi-naive evaluation") that avoids repeated inferences. The program transformation technique focuses the fixpoint evaluation, which is a forward-chaining strategy, by propagating bindings in the goal in a ma...
|
1132
|
The stable model semantics for logic programming
– Gelfond, Lifschitz
- 1988
|
|
715
|
Constraint logic programming
– Jaffar, Lassez
- 1987
|
|
546
|
Towards a theory of declarative knowledge
– Apt, Blair, et al.
- 1987
|
|
421
|
Rete: A fast algorithm for the many pattern/many object pattern match problem
– Forgy
- 1989
|
|
315
|
Constraint query languages
– Kanellakis, Kuper, et al.
- 1990
|
|
251
|
Magic sets and other strange ways to implement logic programs
– Bancilhon, Maier, et al.
- 1986
|
|
193
|
The universality of data retrieval languages
– Aho, Ullman
- 1979
|
|
147
|
Logic-based approach to semantic query optimization
– Chakravarthy, Grant, et al.
- 1990
|
|
139
|
A Logical Language for Data and Knowledge Bases
– Naqvi, Tsur
- 1989
|
|
132
|
Parsing as deduction
– Pereira, Warren
- 1983
|
|
90
|
Modular stratification and magic sets for datalog programs with negation
– Ross
- 1994
|
|
87
|
Extended stable semantics for normal and disjunctive programs
– Przymusinski
- 1990
|
|
79
|
The LDL system prototype
– Chimenti, Gamboa, et al.
- 1990
|
|
78
|
A Uniform Approach to Constraint Satisfaction and Constraint Satisfiability
– Bry, Decker, et al.
- 1988
|
|
71
|
Equivalence of Logic Programs
– Maher
- 1988
|
|
68
|
clause queries and generalizations
– K, Horn
- 1985
|
|
61
|
On the declarative semantics of stratified deductive databases and logic programs
– Przymusinski
- 1988
|
|
60
|
QUIST: A system for semantic query optimization in relational databases
– KING
- 1981
|
|
59
|
Glue-Nail: A deductive database system
– Phipps, Derr, et al.
- 1991
|
|
58
|
Semantics of logic programs with aggregates
– Kemp, Stuckey
- 1991
|
|
57
|
A generalization of the differential approach to recursive query evaluation
– Balbin, Ramamohanarao
- 1987
|
|
57
|
Decidable optimization problems for database logic programs
– Cosmadakis, Gaifman, et al.
- 1988
|
|
55
|
Query evaluation in recursive databases: Bottom-up and top-down reconciled
– Bry
- 1990
|
|
54
|
Extension tables: Memo relations in logic programming
– Dietrich
- 1987
|
|
46
|
Weakly perfect model semantics for logic programs
– Przymusinska, Przymusinski
- 1988
|
|
46
|
A Closed Form for Datalog Queries with Integer Order
– Revesz
- 1990
|
|
42
|
Naïve evaluation of recursively defined relations
– Bancilhon
- 1985
|
|
42
|
Set constructors in a logic database language
– Beeri, Naqvi, et al.
- 1991
|
|
42
|
Design overview of the NAIL! system
– Morris, Unman, et al.
- 1986
|
|
41
|
The Alexander method: a technique for the processing of recursive atoms in deductive databases
– Rohmer, Lescoeur, et al.
- 1986
|
|
39
|
On the Representation of Infinite Temporal Data and Queries
– Baudinet, Niezette, et al.
- 1991
|
|
38
|
Rule ordering in bottom-up fixpoint evaluation of logic programs
– Ramakrishnan, Srivastava, et al.
- 1990
|
|
33
|
Low complexity aggregation in graphlog and datalog
– Consens, Mendelzon
- 1990
|
|
33
|
Magic sets and bottom-up evaluation of well-founded models
– Kemp, Srivastava
- 1991
|
|
31
|
HiLog: A First-Order Semantics for Higher-Order Logic Programming Constructs
– Chen, Kifer, et al.
- 1989
|
|
31
|
Minimum and maximum predicates in logic programming
– Ganguly, Greco, et al.
- 1991
|
|
29
|
The sharing of structure in theorem-proving programs
– Boyer, Moore
- 1972
|
|
27
|
Towards an Open Architecture for LDL
– Chimenti, Gamboa, et al.
- 1989
|
|
27
|
Magic is relevant
– Mumick, Finkelstein, et al.
|
|
26
|
Database updates in logic programming
– Naqvi, Krishnamurthy
- 1988
|
|
26
|
Optimizing existential Datalog queries
– Ramakrishnan, Beeri, et al.
- 1988
|
|
25
|
Querying a rule base
– Cholvy, Demelombe
- 1986
|
|
25
|
Monocopy and Associative Algorithms in Extended Lisp". TR
– Goto
- 1974
|
|
25
|
Argument reduction through factoring
– Naughton, Ramakrishnan, et al.
- 1989
|
|
25
|
Modular acyclicity and tail recursion in logic programs
– Ross
- 1991
|
|
23
|
Efficient evaluation of right-, left-, and multi-linear rules
– Naughton, Ramakrishnan, et al.
- 1989
|
|
22
|
Polynomial time query processing in temporal deductive databases
– Chomicki
- 1990
|
|
22
|
Data independent recursion in deductive databases
– Naughton
- 1989
|
|
22
|
The generalized counting method for recursive logic queries
– Sacca, Zaniolo
- 1989
|
|
21
|
Aggregative closure: an extension of transitive closure
– Cruz, Norvell
- 1989
|
|
