Fixpoint logics, relational machines, and computational complexity

Journal of the ACM

Volumn 44, Issue 1, 1997, Pages 30-56

  Abiteboul, Serge ^a   Vardi, Moshe Y ^b,d   Vianu, Victor ^c  

^a INRIA   (France)

^b RICE UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; ENCODING (SYMBOLS); FORMAL LOGIC; NUMERICAL METHODS; RANDOM ACCESS STORAGE; TURING MACHINES;

BOUNDED ACTION DEVICES; FIXPOINT LOGICS; RELATIONAL COMPLEXITY; RELATIONAL MACHINES;

COMPUTATIONAL COMPLEXITY;

EID: 0030713542     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/256292.256295     Document Type: Article

References (61)

1. ABITEBOUL S., SIMON E., AND VIANU, V. 1990. Non-deterministic languages to express deterministic transformations. In Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Nashville, Tenn., Apr. 2-4). ACM, New York, pp. 218-229.
2. ABITEBOUL, S., VARDI, M. Y., AND VIANU, V. 1995. Computing with infinitary logic. Theoret. Comput. Sci. 149, 101-128.
3. ABITEBOUL, S., AND VIANU, V. 1989. Fixpoint extensions of first-order logic and Datalog-like languages. In Proceedings of the 4th IEEE Symposium on Logic in Computer Science. IEEE, New York, pp. 71-79.
4. ABITEBOUL, S., AND VIANU, V. 1991a. Datalog extensions for database queries and updates. J. Comput. Syst. Sci. 43, 62-124.
5. ABITEBOUL, S., AND VIANU, V. 1991b. Generic computation and its complexity. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (New Orleans, La., May 6-8). ACM New York, pp. 209-219.
6. ABITEBOUL, S., AND VIANU, V. 1995. Computing with first-order logic. J. Comput. Syst. Sci. 50, 309-335.
7. AHO, A. V., AND ULLMAN, J. D. 1979. Universality of data retrieval languages. In Proceedings of the 6th Annual ACM Symposium on Principles of Programming Languages (San Antonio, Tex., Jan 29-31). ACM, New York, pp. 110-120.
8. BARWISE, J. 1977. On Moschovakis closure ordinals. J. Symb. Logic 42, 292-296.
9. BUSS, S. R., 1986. Bounded Arithmetics. Bibliopolis, Naples, Italy.
10. CHANDRA, A., AND HAREL, D. 1980. Computable queries for relational databases. J. Comput. Syst. Sci. 21, 156-178.
11. CHANDRA, A., AND HAREL, D. 1982. Structure and complexity of relational queries. J. Comput. Syst. Sci. 25, 99-128.
12. CHANDRA, A., KOZEN, D., AND STOCKMEYER, L. 1981. Alternation. J. ACM 28, 114-133.
13. CODD, E. F. 1972. Relational completeness of data base sublanguages. In Database Systems, R. Rustin, ed. Prentice-Hall, Englewood Cliffs, N.J., pp. 33-64.
14. 1. In Proceedings of the 3rd IEEE Symposium on Logic in Computer Science. IEEE, New York, pp. 12-21.
15. DAWAR, A., LINDELL, S., AND WEINSTEIN, S. 1995. Infinitary logic and inductive definability over finite structures. Inf. Comput. 119, 160-175.
16. DE ROUGEMONT, M. 1984. Uniform definability on finite structures with successor. In Proceedings of the 16th Annual ACM Symposium on Theory of Computing (Washington, D.C., Apr. 30-May 2). ACM, New York, pp. 409-417.
17. FAGIN, R. 1974. Generalized first-order spectra and polynomial-time recognizable sets. In Complexity of Computation, SIAM-AMS Proceedings, Vol. 7. R. M. Karp, ed. American Mathematical Society, Providence, R.I. pp. 43-73.
18. FAGIN, R. 1975. Monadic generalized spectra. Z. Math. Logik Grundl. Math. 21, 89-96.
19. FEDER, T. 1991. Stable networks and product graphs. Ph.D. dissertation. Stanford Univ. Stanford, Calif.
20. FRIEDMAN, H. 1971. Axiomatic recursive function theory. In Logic Colloquium '69, R. O. Gandy and C. E. M. Yateb, eds. North-Holland, Amsterdam, The Netherlands, pp. 113-137.
21. GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and Intractability - A guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco, Calif.
22. GIRARD, J.-Y., SCEDROV, A., AND SCOTT, P. 1990. Bounded linear logic: A modular approach to polynomial time computability. In Feasible Mathematics, S. R. Buss and P. Scott, eds. Birkhauser, Boston, Mass., pp. 195-207.
23. GOERDT, A. 1989. Characterizing complexity classes by higher-type primitive-recursive definitions. In Proceedings of the 4th IEEE Symposium on Logic in Computer Science. IEEE, New York, pp. 364-374.
24. GRÄDEL, E., AND MCCOLM, G. 1992a. Deterministic versus nondeterministic transitive closure logic. In Proceedings of the 7th IEEE Symposium on Logic in Computer Science. IEEE, New York, pp. 58-63.
25. GRÄDEL, E., AND MCCOLM, G. 1992b. Hierarchies in transitive closure logic, stratified datalog and infinitary logic. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science. IEEE New York, pp. 167-176.
26. GRANDJEAN, E. 1984. The spectra of first-order sentences and computational complexity. SIAM J. Comput. 13, 356-373.
27. GRANDJEAN, E. 1985. Universal quantifiers and time complexity of random access machines. Math. Syst. Theory 13, 171-187.
28. GROHE, M. 1996. Equivalence in finite-variable logics is complete for polynomial time. In Proceedings of the 37th Annual IEEE Symposium of Foundations of Computer Science. IEEE, New York, pp. 264-273.
29. GUREVICH, Y. 1983. Algebras of feasible functions. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 210-214.
30. GUREVICH, Y. 1984. Toward logic tailored for computational complexity. In Computation and Proof Theory, M. M. Richter et al., eds. Lecture Notes in Mathematics, vol. 1104. Springer-Verlag, New York, pp. 175-216.
31. GUREVICH, Y. 1988. Logic and the challenge of computer science. In Current Trends in Theoretical Computer Science, E. Börger, ed. Computer Science Press, Rockville, Md., pp. 1-57.
32. GUREVICH, Y., AND SHELAH, S. 1986. Fixed-point extensions of first-order logic. Ann. Pure Appl. Logic 32, 265-280.
33. HAREL, D., AND PELEG, D. 1984. Static logics, dynamic logics, and complexity classes. Inf. Cont. 60, 86-102.
34. HOPCROFT, J. E., AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass.
35. IMMERMAN, N. 1982. Upper and lower bounds for first-order expressibility. J. Comput. Syst. Sci. 25, 76-98.
36. IMMERMAN, N. 1986. Relational queries computable in polynomial time. Inf. Cont. 68, 86-104.
37. IMMERMAN, N. 1987a. Expressibility as a complexity measure: Results and directions. In Proceedings of the 2nd Structure in Complexity Conference. IEEE, New York, pp. 194-202.
38. IMMERMAN, N. 1987b. Languages that capture complexity classes. SIAM J. Comput. 16, 760-778.
39. IMMERMAN, N. 1989. Descriptive and computational complexity. In Computational Complexity Theory, Proceedings of the Symposium on Applied Mathematics, vol. 38, J. Hartmanis, ed. American Mathematical Society, Providence, R.I., pp. 75-91.
40. IMMERMAN, N., AND LANDER, E. S. 1990. Describing graphs: A first-order approach to graph canonization. In Complexity Theory Retrospective, A. Selman, ed. Springer-Verlag, New York, pp. 59-81.
41. JONES, N. G., AND SELMAN, A. L. 1974. Turing machines and the spectra of first-order formulas. J. Symb. Logic 39, 139-150.
42. KOLAITIS, PH. G., AND VARDI, M. Y. 1992. Infinitary logics and 0-1 laws. Inf. Comput. 98, 258-294.
43. KOLAITIS, PH. G., AND VARDI, M. Y. 1995. On the expressive power of Datalog: tools and a case study. J. Comput. Syst. Sci. 51, 110-134.
44. LEIVANT, D. 1989a. Descriptive characterization of computational complexity. J. Comput. Syst. Sci. 39, 51-83.
45. LEIVANT, D. 1989b. Monotonic use of space and computational complexity over abstract structures. Unpublished manuscript.
46. LEIVANT, D. 1990. Inductive definitions over finite structures. Inf. Comput. 89, 95-108.
47. LEIVANT, D. 1991. A foundational delineation of computational feasibility. In Proceedings of the 6th IEEE Symposium on Logic in Computer Science. IEEE, New York, pp. 2-11.
48. LINDELL, S. 1991. An analysis of fixed point queries on binary trees. Theoret. Comput. Sci. 85, 75-95.
49. LIVCHAK, A. B. 1982. The relational model for systems of automatic testing. Autom. Doc. Math. Ling. 4, 17-19.
50. LIVCHAK, A. B. 1983. The relational model for process control. Autom. Doc. Math. Ling. 4, 27-29.
51. LYNCH, J. F. 1982. Complexity classes and theories of finite models. Math. Syst. Theory 15, 127-144.
52. MOSCHOVAKIS, Y. N. 1974. Elementary Induction on Abstract Structures. North-Holland, Amsterdam, The Netherlands.
53. SAVITCH, W. J. 1980. Relational between nondeterministic and deterministic tape complexity. J. Comput. Syst. Sci. 4, 177-192.
54. SAZONOV, V. YU. 1980a. A logical approach to the problem of P = NP. In Proceedings of 9th Conference on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 88. Springer-Verlag, New York, pp. 561-575.
55. SAZONOV, V. YU. 1980b. Polynomial computability and recursivity in finite domains. Elektron. Inf. Kyber. 16, 319-323.
56. SCHWENTICK, T. 1994. Graph connectivity and monadic NP. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 614-622.
57. STOCKMEYER, L. J. 1977. The polynomial-time hierarchy. Theoret. Comput. Sci. 3, 1-22.
58. STRAUBING, H. 1994. Finite Automata, Formal Logic, and Circuit Complexity. Birkhauser, Boston, Mass.
59. TIURYN, J., AND URZYCZYN, P. 1988. Some relationships between logic of programs and complexity theory. Theoret. Comput. Sci. 60, 83-108.
60. ULLMAN, J. D. 1989. Database and Knowledge-Base Systems, vol. I and II. Computer Science Press.
61. VARDI, M. Y. 1982. The complexity of relational query languages. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing, (San Francisco, Calif. May 5-7). ACM, New York, pp. 137-146.