A single recursive predicate is sufficient for pure datalog

Information and Computation

Volumn 117, Issue 1, 1995, Pages 91-97

  Shmueli, Oded ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30244538075     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1995.1031     Document Type: Article

References (8)

1. Chandra, A. K., and Harel, D. (1982), Structure and complexity of relational queries, J. Comput. System Sci. 25: 99-128.
2. Chandra, A. K., and Harel, D. (1985), Horn clauses queries and generalizations, J. Logic Programming 1 (1), 15.
3. Lloyd, J. W. (1984), "Foundations of Logic Programming," Springer-Verlag, Berlin/New York.
4. Moschovakis, Y. N. (1974), "Elementary Induction on Abstract Structures," North-Holland, Amsterdam.
5. Naqvi, S. and Tsur, S. (1989), "A Logical Language for Data and Knowledge Bases," Comput. Sci. Press, Potomac, MD.
6. Naqvi, S. and Tsur, S. "Proceedings of ACM SIGCAT- SIGMOD S1GART Symposium on Principles of Database Systems, 1986-1993."
7. Shmueli, O. (1987), Decidability and expressiveness aspects of logic queries, in "Proceedings Sixth ACM SIGCAT-SIGMOD- SIGART Symposium on Principles of Database Systems, San Diego, March 1987," pp. 237-249.
8. Ullman, J. D. (1988), "Principle of Database and Knowledge- Based Systems," Vol. 1, 2, Comput. Sci. Press, Potomac, MD.