|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
CHANG, C. On evaluation of quenes containing derived relations in a relational data. In Advances in Data Base Theory, Vol. 1, H. Gallaire and J. Minker, and J. M. Nicolas, Eds., Plenum Press, New York, 1981, pp. 235-260.
|
| |
3
|
FISHMAN, D., AND MINKER, J. H-representation: A clause representation for parallel search. Artif. Intell. 6 (1975), 103-127
|
| |
4
|
MCKAY, D. AND SHAPIRO, S. Using active connection graphs for reasoning with recursive rules. In Proc of 7th Int Joint Conf. on Artificial Intelligence, Vancouver, B.C., Aug. 24-28, 1981.
|
| |
5
|
MINKER, J. AND NICOLAS, J. M. On recursive axioms in relational databases. Tech. Rep. TR- 1119, University of Maryland, College Park, Md., 1981.
|
| |
6
|
NILSSON, J Computational schemes for recursive relational languages. In Workshop on Formal Basis for Data Bases, Toulouse, France, 1979.
|
| |
7
|
REITER, R. Deductive question answering on relational data bases. In Logic and Data Bases, H. Gallaire and J. Minker, Eds, Plenum Press, New York, 1978, pp. 149-177.
|
| |
8
|
REITER, R. On structuring a first-order database. In Proe of 2nd Nat. Conf. Canadian Society for Computational Studies of Intelligence, Toronto, July 19-21, 1978, pp. 90-99.
|
| |
9
|
REITER, R. On closed world databases. In Logic and Data Bases. H. Gallaire and J. Minker, Eds., Plenum Press, New York, 1978, pp. 55-76.
|
 |
10
|
|
 |
11
|
|
| |
12
|
SHAPIRO, S. AND MCKAY, D. Inference with recursive rules. In Proc AAAI Conf. on Artificial Intelligence, Stanford, Calif., 1980, pp. 151-153.
|
| |
13
|
SICKEL, S. A search technique for clause mterconnectivity graphs. IEEE Trans. Comput. C-25, 8 (Aug. 1976), pp. 823-834.
|
| |
14
|
|
CITED BY 86
|
|
Stavros Cosmadakis , Haim Gaifman , Paris Kanellakis , Moshe Vardi, Decidable optimization problems for database logic programs, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.477-490, May 02-04, 1988, Chicago, Illinois, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A. Marchetti-Spaccamella , A. Pelaggi , D. Sacca, Worst-case complexity analysis of methods for logic query implementation, Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.294-301, March 23-25, 1987, San Diego, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
G. Grahne , S. Sippu , E. Soisalon-Soininen, Efficient evaluation for a subset of recursive queries, Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.284-293, March 23-25, 1987, San Diego, California, United States
|
|
|
|
|
|
J. F. Naughton , R. Ramakrishnan , Y. Sagiv , J. D. Ullman, Efficient evaluation of right-, left-, and multi-linear rules, ACM SIGMOD Record, v.18 n.2, p.235-242, June 1989
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
C. Beeri , P. Kanellakis , F. Bancilhon , R. Ramakrishnan, Bounds on the propagation of selection into logic programs, Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.214-226, March 23-25, 1987, San Diego, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
REVIEW
"Jack Minker : Reviewer"
As has been shown by Aho and Ullman [1], for example, the language of the
relational algebra has limitations in that some operations, such as the
transitive closure of a relation, cannot be expressed.
In deductive databases, on extend
more...
|