Skip to main content
SpringerLink
Log in

Adding For-Loops to First-Order Logic

Extended Abstract

  • Conference paper
  • First Online:
Book cover Database Theory — ICDT’99 (ICDT 1999)

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

Included in the following conference series:

Abstract

We study the query language BQL: the extension of the relational algebra with for-loops. We also study FO(FOR): the extension of first-order logic with a for-loop variant of the partial fixpoint operator. In contrast to the known situation with query languages which include while-loops instead of for-loops, BQL and FO(FOR) are not equivalent. Among the topics we investigate are: the precise relationship between BQL and FO(FOR); inflationary versus non-inflationary iteration; the relationship with logics that have the ability to count; and nested versus unnested loops.

Research Assistant of the Fund for Scientific Research, Flanders.

Research begun at RWTH Aachen, supported by a German Research Council DFG grant, continued at the University of Warsaw, supported by the Polish Research Council KBN grant 8 T11C 002 11, and on leave at the University of New South Wales, supported by the Australian Research Council ARC grant A 49800112 (1998-2000).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

    Google Scholar 

  2. S. Abiteboul and V. Vianu. Computing with first-order logic. Journal of Computer and System Sciences, 50(2):309–335, 1995.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  4. A. Chandra. Programming primitives for database languages. In Conference Record, 8th ACM Symposium on Principles of Programming Languages, pages 50–62 1981.

    Google Scholar 

  5. A. Chandra. Theory of database queries. In Proceedings of the Seventh ACM Symposium on Principles of Database Systems, pages 1–9. ACM Press, 1988.

    Google Scholar 

  6. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.

    Google Scholar 

  7. H.-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic. Undergraduate Texts in Mathematics. Springer-Verlag, second edition 1994.

    Google Scholar 

  8. E. Grädel and M. Otto. Inductive definability with counting on finite structures. In E. Börger, editor, Computer Science Logic, volume 702 of Lecture Notes in Computer Science, pages 231–247. Springer-Verlag, 1993.

    Google Scholar 

  9. L. Hella, Ph. G. Kolaitis, and K. Luosto. Almost everywhere equivalence of logics in finite model theory. Bulletin of Symbolic Logic, 2(4):422–443 1996.

    Article  MATH  MathSciNet  Google Scholar 

  10. Ph. G. Kolaitis and Jouko A. Väänänen. Generalized quantifiers and pebble games on finite structures. Annals of Pure and Applied Logic, 74(1):23–75, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  11. M. Otto. The expressive power of fixed-point logic with counting. Journal of Symbolic Logic, 61(1):147–176 1996.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Limburgs Universitair Centrum, Germany

    Frank Neven & Jan Van den Bussche

  2. RWTH Aachen, Germany

    Martin Otto

  3. Warsaw University, germany

    Jurek Tyszkiewicz

Authors
  1. Frank Neven
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jurek Tyszkiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jan Van den Bussche
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, The Hebrew University, Givat-Ram, Jerusalem, 91940, Israel

    Catriel Beeri

  2. Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, 19104-6389, USA

    Peter Buneman

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Neven, F., Otto, M., Tyszkiewicz, J., Van den Bussche, J. (1999). Adding For-Loops to First-Order Logic. In: Beeri, C., Buneman, P. (eds) Database Theory — ICDT’99. ICDT 1999. Lecture Notes in Computer Science, vol 1540. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49257-7_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-49257-7_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65452-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation