Skip to main content
SpringerLink
Log in

Computing on structures

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 700))

Included in the following conference series:

  • 134 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afrati, F., S.S. Cosmadakis, M. Yannakakis, On Datalog vs. polynomial time, Proc. 10th ACM Symp. on Principles of Database Systems, 1991.

    Google Scholar 

  2. S. Abiteboul and P.C. Kanellakis. Object identity as a query language primitive. In Proc. ACM SIGMOD Symp. on the Management of Data, pages 159–173, 1989. to appear in J. ACM.

    Google Scholar 

  3. S. Abiteboul and V. Vianu. Fixpoint extensions of first-order logic and Datalog-like languages. In Proc. 4th IEEE Symp. on Logic in Computer Science, pages 71–79, 1989.

    Google Scholar 

  4. S. Abiteboul and V. Vianu. Procedural languages for database queries and updates. Journal of Computer and System Sciences, 41:181–229, 1990.

    Google Scholar 

  5. S. Abiteboul and V. Vianu. Generic computation and its complexity. In Proc. ACM SIGACT Symp. on the Theory of Computing, pages 209–219, 1991.

    Google Scholar 

  6. S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. Journal of Computer and System Sciences, 43:62–124, 1991.

    Google Scholar 

  7. S. Abiteboul and V. Vianu. Computing with first-order logic. To appear in Journal of Computer and System Sciences.

    Google Scholar 

  8. S. Abiteboul, Moshe Y. Vardi, and V. Vianu. Fixpoint. logics, relational machines, and computational complexity. In Proc. Conf. on Structure in Complexity Theory, Boston, 1992.

    Google Scholar 

  9. S. Abiteboul, Moshe Y. Vardi, and V. Vianu. Computing with infinitary logic. To appear in Int'l. Conf. on Database Theory, Berlin, 1992.

    Google Scholar 

  10. Barwise, J., Admissible Sets and Structures, Springer-Verlag, 1975.

    Google Scholar 

  11. Barwise, J., On Moschovakis closure ordinals, J. Symbolic Logic, 42 (1977), pp. 292–296.

    Google Scholar 

  12. Barwise, J., S. Feferman (eds.), Model-Theoretic Logics, Springer-Verlag, 1985.

    Google Scholar 

  13. S. R. Buss. Bounded Arithmetics. Bibliopolis, 1986.

    Google Scholar 

  14. A.K. Chandra and D. Harel. Computable queries for relational data bases. Journal of Computer and System Sciences, 21(2):156–178, 1980.

    Google Scholar 

  15. A.K. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25(1):99–128, 1982.

    Google Scholar 

  16. A.K. Chandra. Programming primitives for database languages. In Proc. ACM Symp. on Principles of Programming Languages, pages 50–62, 1981.

    Google Scholar 

  17. A. Chandra, D. Kozen, and L. Stockmeyer. Alternation. Journal of the ACM, 28:114–133, 1981.

    Google Scholar 

  18. K. J. Compton. An algebra and a logic for NC1. In Proc. 3rd IEEE Symp. on Logic in Computer Science, pages 12–21, 1988.

    Google Scholar 

  19. A. Dawar, S. Lindell, and S. Weinstein. Infinitary logic and inductive definability over finite structures. Research report, Univ. of Pennsylvania, 1991.

    Google Scholar 

  20. K. Denninghoff and V. Vianu, The Power of Methods with Parallel Semantics, In Proc. Intern. Conf. on Very Large Data Bases, pages 221–232, 1991.

    Google Scholar 

  21. R. Fagin. Generalised first-order spectra and polynomial-time recognizable sets. In R. M. Karp, editor, Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, pages 43–73, 1974.

    Google Scholar 

  22. R. Fagin. Monadic generalized spectra. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 21:89–96, 1975.

    Google Scholar 

  23. Fagin R., Finite-Model Theory—a Personal Perspective, Proc. 3rd Int'l. Conf. on Database Theory, Springer-Verlag, Lecture Notes in Computer Science 470, 1990, pp. 3–24, to appear in Theoretical Computer Science.

    Google Scholar 

  24. T. Feder. Stable networks and product graphs. PhD thesis, Stanford University, 1981.

    Google Scholar 

  25. H. Friedman. Algorithmic procedures, generalized turing algorithms, and elementary recursion theory. In R.O.Gangy and C.M.E.Yates, editors, Logic Colloquium '69, pages 361–389. North Holland, 1971.

    Google Scholar 

  26. A. Goerdt. Characterizing complexity classesby higher-type primitive-recursive definitions. In Proc. 4th IEEE Symp. on Logic in Computer Science, pages 364–374, 1989.

    Google Scholar 

  27. E. Grandjean. The spectra of first-order sentences and computational complexity. SIAM Journal on Computing, 13:356–373, 1984.

    Google Scholar 

  28. E. Grandjean. Universal quantifiers and time complexity of random access machines. Mathematical System Theory, 13:171–187, 1985.

    Google Scholar 

  29. Y. Gurevich. Algebras of feasible functions. In Proc. 24th IEEE Symp. on Foundations of Computer Science, pages 210–214, 1983.

    Google Scholar 

  30. Y. Gurevich. Toward logic tailored for computational complexity. In M. M. Ricther et al., editor, Computation and Proof Theory, Lecture Notes in Mathematics 1104, pages 175–216. Springer-Verlag, 1984.

    Google Scholar 

  31. Y. Gurevich. Logic and the challenge of computer science. In E. Börger, editor, Current trends in theoretical computer science, pages 1–57. Computer Science Press, 1988.

    Google Scholar 

  32. Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic, 32:265–280, 1986.

    Google Scholar 

  33. J-Y. Girard, A. Scedrov, and P. SCott. Bounded linear logic: a modular approach to polynomial time computability. In S. R. Buss and P. Scott, editors, Feasible Mathematics, pages 195–207. Birkhauser, 1990.

    Google Scholar 

  34. J. Hartmanis. On nondeterminacy in simple computing devices. Acta Informatica, 1:336–344, 1972.

    Google Scholar 

  35. N. Immerman and E. S. Lander. Describing graphs: a first-order approach to graph canonization. In A. Selman, editor, Complexity Theory Retrospective, pages 59–81. Springer-Verlag, 1990.

    Google Scholar 

  36. N. Immerman. Upper and lower bounds for first-order expresibility. Journal of Computer and System Sciences, 25:76–98, 1982.

    Google Scholar 

  37. N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986.

    Google Scholar 

  38. N. Immerman. Expressibility as a complexity measure: results and directions. In Second Structure in Complexity Conference, pages 194–202, 1987.

    Google Scholar 

  39. N. Immerman. Languages that capture complexity classes. SIAM Journal of Computing, 16:760–778, 1987.

    Google Scholar 

  40. N. Immerman. Descriptive and computational complexity. In J. Hartmanis, editor, Computational Complexity Theory, Proc. Symp. Applied Math., Vol. 38, pages 75–91. American Mathematical Society, 1989.

    Google Scholar 

  41. N. G. Jones and A.L. Selman. Turing machines and the spectra of first-order formulas. Journal of Symbolic Logic, 39:139–150, 1974.

    Google Scholar 

  42. P. C. Kanellakis. Elements of relational database theory. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 1074–1156. North Holland, 1991.

    Google Scholar 

  43. Ph. G. Kolaitis and M. Y. Vardi. 0–1 laws for infinitary logics. In Proc. 5th IEEE Symp. on Logic in Computer Science, pages 156–167, 1990.

    Google Scholar 

  44. Ph. G. Kolaitis and M. Y. Vardi. On the expressive power of Datalog: tools and a case study. In Proc. 9th ACM Symp. on Principles of Database Systems, pages 61–71, 1990. Full version appeared in IBM Research Report RJ8010, March 1991.

    Google Scholar 

  45. Kolaitis, P., M.Y. Vardi, Fixpoint vs. infinitary logic in finite-model theory, to appear in Proc. 7th IEEE Symp. on Logic in Computer Science, 1992.

    Google Scholar 

  46. D. Leivant. Descriptive characterization of computational complexity. Journal of Computer and System Sciences, 39:51–83, 1989.

    Google Scholar 

  47. D. Leivant. Monotonic use of space and computational complexity over abstract structures. Unpublished manuscript, 1989.

    Google Scholar 

  48. D. Leivant. Inductive definitions over finite structures. Information and Computation, 89:95–108, 1990.

    Google Scholar 

  49. D. Leivant. A foundational delineation of computational feasibility. In Proc. 6th IEEE Symp. on Logic in Computer Science, pages 2–11, 1991.

    Google Scholar 

  50. S. Lindell. An analysis of fixed point queries on binary trees. Theoretical Computer Science, 85:75–95, 1991.

    Google Scholar 

  51. D. Luckham and D. Park. The undecidability of the equivalence problem for program schemata. Technical Report UCSC-CRL-89-40, UCSC, December 1989. to appear in ACM Transactions on Database Systems.

    Google Scholar 

  52. D. Luckham, D. Park, and M. Paterson. Formalized computer programs. Journal of Computer and System Sciences, 4:220–249, 1970.

    Google Scholar 

  53. Y. N. Moschovakis. Elementary Induction on Abstract Structures. North Holland, 1974.

    Google Scholar 

  54. M. de Rougemont. Uniform definability on finite structures with successor. In Proc. 16th ACM Symp. on Theory of Computing, pages 409–417, 1984.

    Google Scholar 

  55. V. Yu. Sazonov. Polynomial computability and recursivity in finite domains. Elektronische Informationverarbeitung und Kybernetik, 16:319–323, 1980.

    Google Scholar 

  56. J. C. Shepherdson. Algorithmic procedures, generalized turing algorithms, and elementary recursion theory. In L.A. Harrington et al., editor, Harvey Friedman's research on the foundations of mathematics, pages 285–308. North Holland, 1985.

    Google Scholar 

  57. L. J. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3:1–22, 1977.

    Google Scholar 

  58. A. Tarski. What are logical notions? History and Philosophy of Logic, 7:143–154, 1986. (Ed. J. Corcoran).

    Google Scholar 

  59. J. Tiuryn and P. Urzyczyn. Some relationships between logic of programs and complexity theory. Theoretical Computer Science, 60:83–108, 1988.

    Google Scholar 

  60. J.D. Ullman. Principles of Database and Knowledge Base Systems: Volume I and II. Computer Science Press, 1988.

    Google Scholar 

  61. M.Y. Vardi. The complexity of relational query languages. In Proc. ACM SIGACT Symp. on the Theory of Computing, pages 137–146, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA, BP 105, 78153, Le Chesnay Cedex, France

    Serge Abiteboul

  2. CSE C-0114, UC San Diego, 92093, La Jolla, CA, USA

    Victor Vianu

Authors
  1. Serge Abiteboul
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Victor Vianu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Lingas Rolf Karlsson Svante Carlsson

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abiteboul, S., Vianu, V. (1993). Computing on structures. In: Lingas, A., Karlsson, R., Carlsson, S. (eds) Automata, Languages and Programming. ICALP 1993. Lecture Notes in Computer Science, vol 700. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_106

Download citation

  • DOI: https://doi.org/10.1007/3-540-56939-1_106

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56939-8

  • Online ISBN: 978-3-540-47826-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation