Chapter

Database Theory — ICDT’99

Volume 1540 of the series Lecture Notes in Computer Science pp 58-69

Date:

Adding For-Loops to First-Order Logic

Extended Abstract
  • Frank NevenAffiliated withLimburgs Universitair Centrum
  • , Martin OttoAffiliated withRWTH Aachen
  • , Jurek TyszkiewiczAffiliated withWarsaw University
  • , Jan Van den BusscheAffiliated withLimburgs Universitair Centrum

* Final gross prices may vary according to local VAT.

Get Access

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.