Selected papers that cite this one
- Surajit Chaudhuri and Phokion G. Kolaitis. Can Datalog be approximated? Journal of Computer and System Sciences, 55(2):355-369, October 1997.
- Surajit Chaudhuri and Moshe Y. Vardi. On the equivalence of recursive and nonrecursive Datalog programs. Journal of Computer and System Sciences, 54(1):61-78, February 1997.
- Stavros Cosmadakis. The complexity of evaluating relational queries. Information and Control, 58(1-3):101-112, July/August/September 1983.
- Guozhu Dong and Jianwen Su. Conjunctive query containment with respect to views and constraints. Information Processing Letters, 57(2):95-102, 29 January 1996.
- Irène Guessarian and Marcos Veloso-Peixoto. About boundedness for some Datalog and Datalog^{neg} programs. Journal of Logic and Computation, 4(4):375-403, August 1994.
- Yannis E. Ioannidis and Eugene Wong. Towards an algebraic theory of recursion. Journal of the ACM, 38(2):329-381, April 1991.
- Yehoshua Sagiv. Evaluation of queries in independent database schemes. Journal of the ACM, 38(1):120-161, January 1991.
- Yatin P. Saraiya. On the efficiency of transforming database logic programs. Journal of Computer and System Sciences, 51(1):87-109, August 1995.