- [1] Aho, A. V., and Ullman, J. D. 1979. "Universality of data retrieval languages". Proceedings of the 6th ACM Symposium on Principles of Programming Languages (San Antonio, Texas, Jan. 29-31). ACM, New York, pp. 110-120. Google ScholarDigital Library
- [2] Bancilhon, F. 1978. "On the completeness of query languages for relational databases". Proceedings of the 7th Symp. of Math Found. of Comp. Sci. Springer-Verlag, Berlin, pp. 112-123.Google Scholar
- [3] Chandra, A. K. and Harel, D. 1979. "Computable queries for relational databases". Proceedings 11th ACM Symp. on Theory of Computing., Atlanta, Georgia, pp. 309-318. Google ScholarDigital Library
- [4] Chandra, A. K. and Harel, D. 1980. "Structure and Complexity of Relational Queries". Proceedings of the 21st IEEE Symposium on Foundations of Computer Science (Syracuse, N.Y., Oct.). IEEE, New York, pp. 333-347. Also in J. of Comput. Syst. Sci. 25, 1(Aug. 1982), 99-128.Google Scholar
- [5] Gallaire, H. and Minker, J., Eds. 1978. Logic and Data Bases. Plenum, New York. Google ScholarDigital Library
- [6] Gallaire, H., Minker. J. and Nicolas, J.-M., Eds., 1981. Advances in Data Base Theory, Vol. I, Plenum, New York. Google ScholarDigital Library
- [7] Gallaire, H., Minker, J. and Nicolas, J.-M., Eds. 1984. Advances in Data Base Theory, Vol. II. Plenum, New York. Google ScholarDigital Library
- [8] Harel, D. 1980. Review of Logic and Databases, H. Gallaire and J. Minker. In: Comput. Rev. 21, 8(Aug.), 367-369.Google Scholar
- [9] Nicolas, J.-M. and Syre, J.-C., 1974. "Natural question answering and automatic deduction in the system SYNTEX". Proceedings IFIP Cong. 1974. North Holland, Amsterdam, pp. 595-599.Google Scholar
- [10] Paredaens, J., 1978. "On the expressive power of relational algebra". Inf. Process. Letters 7, 2 (Feb.), pp. 107-111.Google ScholarCross Ref
- [11] Bancilhon, F. and Ramakrishnan, R., 1986 "An Amateur's Introduction to Recursive Query Processing Strategies", Proceedings ACM SIGMOD'86 Conference, Washington D. C., May, 1986. Google ScholarDigital Library
- [12] Vieille, L., 1986. "Recursive Axioms in Deductive Databases: the Query/SubQuery approach." Proceedings 1st Conference on "Expert Database Systems", Charleston, South-Carolina, April, 1986.Google Scholar
Index Terms
- Logic and databases: a response
Recommendations
Minimal founded semantics for disjunctive logic programs and deductive databases
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non-disjunctive) programs, but differs ...
A logical account of uncertain databases based on linear logic
ICDT '09: Proceedings of the 12th International Conference on Database TheoryA formal semantics of uncertain databases typically takes an algebraic approach by mapping an uncertain database to a set of relational databases, or possible worlds. We present a new semantics for uncertain databases which takes a logical approach by ...
Comments