Hierarchies in transitive closure logic, stratified datalog and infinitary logic

Annals of Pure and Applied Logic

Volumn 77, Issue 2, 1996, Pages 169-199

  Grädel, Erich ^a   McColm, Gregory L ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF SOUTH FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030605368     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/0168-0072(95)00021-6     Document Type: Article

References (39)

1. [1] F. Afrati and S. Cosmadakis, Expressiveness of restricted recursive queries, Proc. 21st ACM Symp. on Theory of Computing (1989) 113-126.
2. [2] F. Afrati, S. Cosmadakis and M. Yannakakis, On datalog vs. polynomial time, Proc. 10th ACM Symp. on Principles of Database Systems (1991) 113-126.
3. [3] J. Barwise, On Moschovakis closure ordinals, J. Symbolic Logic 42 (1977) 292-296.
4. [4] A. Blass and Y. Gurevich, Henkin quantifiers and complete problems, Ann. Pure Appl. Logic 32 (1986) 1-16.
5. [5] U. Bosse, personal commmunication (1992).
6. [6] J. Cai, M. Fürer and N. Immerman, An optimal lower bound on the number of variables for graph identification. Proc. 30th IEEE Symp. on Foundations of Computer Science (1989) 612-617.
7. [7] A. Chandra and D. Harel, Structure and complexity of relational queries, J. Comput. System Sci. 25 (1982) 99-128.
8. [8] A. Chandra and D. Harel, Horn clause queries and generalizations, J. Logic Programming 1 (1985) 1-15.
9. [9] M. Consens and A. Mendelzon, GraphLog: a visual formalism for real life recursion, Proc. 9th ACM Symp. Principles of Database Systems (1990) 404-416.
10. [10] E. Dahlhaus, Skolem normal forms concerning the least fixed point, in: E. Börger, ed., Computation Theory and Logic, Lecture Notes in Computer Science, Vol. 270 (Springer, Berlin, 1987) 101-106.
11. [11] A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund. Math. 49 (1961) 129-141.
12. [12] R. Fagin, Monadic generalized spectra. Z. Math. Logik Grundlagen Math. 21 (1975) 89-96.
13. [13] R. Fraïssé, Sur quelques classifications des systèmes de relations, Publications Scientifique de l' Universite d' Alger, Série A 1 (1954) 35-182.
14. [14] E. Grädel, On transitive closure logic, Proc. 5th Workshop on Computer Science Logic CSL '91, Lecture Notes in Computer Science, Vol. 626 (Springer, Berlin 1992) 149-163.
15. [15] E. Grädel and G. McColm, Deterministic versus nondeterministic transitive closure logic, Proc. 7th IEEE Conf. on Logic in Computer Science (1992) 58-63.
16. [16] Y. Gurevich, Logic and the challenge of computer science, in: E. Börger, ed., Trends in Theoretical Computer Science (Computer Science Press, Rockville, MD, 1988) 1-57.
17. [17] Y. Gurevich and S. Shelah, Fixed point extensions of first order logic, Ann. Pure Appl. Logic 32 (1986) 265-280.
18. [18] N. Immerman, Number of quantifiers is better than number of tape cells, J. Comput. System Sci. 22 (1981) 65-72.
19. [19] N. Immerman, Upper and lower bounds for first-order expressibihty, J. Comput. System Sci. 25 (1982) 76-98.
20. [20] N. Immerman, Languages that capture complexity classes, SIAM J. Comput. 16 (1987) 760-778. A preliminary version appeared in Proc. 15th ACM Symp. on Theory of Computing (1983) 347-354.
21. [20] N. Immerman, Languages that capture complexity classes, SIAM J. Comput. 16 (1987) 760-778. A preliminary version appeared in Proc. 15th ACM Symp. on Theory of Computing (1983) 347-354.
22. [21] N. Immerman, Relational queries computable in polynomial time, Inform. and Control 68 (1986) 86-104.
23. [22] N. Immerman, Nondeterministic space is closed under complementation, SIAM J. Comput. 17 (1988) 935-939.
24. [23] N. Immerman, Descriptive and computational complexity, in: J. Hartmanis, ed., Computational Complexity Theory, Proc. AMS Symposia in Appl. Math., Vol. 38 (1989) 75-91.
25. [24] P. Kannellakis, Elements of relational database theory, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B, (North-Holland, Amsterdam, 1990) 1073-1156.
26. [25] H.J. Keisler and W. Walkoe Jr., The diversity of quantifier prefixes, J. Symbolic Logic 38 (1973) 79-85
27. [26] Ph. Kolaitis, The Expressive power of stratified logic programs, Inform. and Comput. 90 (1991) 50-66.
28. [27] Ph. Kolaitis and M. Vardi, On the expressive power of datalog: tools and a case study, Proc. 9th ACM Symp. on Principles of Database Systems (1990) 61-71.
29. [28] Ph. Kolaitis and M. Vardi, Infinitary logics and 0-1 laws. Inform. and Comput. 98 (1992) 258-294.
30. [29] V. Lakshmanan and A. Mendelzon, Inductive pebble games and the expressive power of datalog, Proc. 8th ACM Symp. on Principles of Database Systems (1989) 301-310.
31. [30] G. McColm, Parametrization over inductive relations of a bounded number of variables, Ann. Pure Appl. Logic 48 (1990) 103-134.
32. [31] G. McColm, Pebble games and the fine structure of fixedpoint logic, submitted.
33. [32] Y. Moschovakis, Elementary Induction on Abstract Structures (North-Holland, Amsterdam, 1974).
34. [33] L. Stockmeyer, The polynomial time hierarchy. Theoret. Comput. Sci. 3 (1976) 1-22.
35. [34] R. Szelepcsényi, The method of forced enumeration for nondeterministic automata, Acta Informatica 26 (1988) 279-284.
36. [35] A. Van Gelder, Negation as failure using tight derivations for general logic programs, Proc. 3rd IEEE Symp. on Logic Programming (1986) 137-146.
37. [36] M. Vardi, Complexity of relational query languages, Proc. 14th STOC (1982) 137-146.
38. [37] W. Walkoe, Finite partially-ordered quantification, J. Symbolic Logic 35 (1970) 535-555.
39. [38] M. Zloof, Query-by-example: operations on the transitive closure, IBM Research Report RC5526, 1976.