Adding for-loops to first-order logic

Authors:
Frank Neven;Martin Otto;Jurek Tyszkiewicz;Jan Van den Bussche
Affiliations:
Limburgs Univ. Centrum, Diepenbeek, Belgium;Univ. of Wales Swansea, Swansea, UK;Warsaw Univ., Warsaw, Poland;Limburgs Univ. Centrum, Diepenbeek, Belgium
Venue:
Information and Computation
Year:
2001

Citing 8
Cited 1

Relational queries computable in polynomial time

Information and Control
Datalog extensions for database queries and updates

Journal of Computer and System Sciences
Computing with first-order logic

Selected papers of the 23rd annual ACM symposium on Theory of computing
Theory of database queries

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Programming primitives for database languages

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Inductive Definability with Counting on Finite Structures

CSL '92 Selected Papers from the Workshop on Computer Science Logic
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing

The DNA query language DNAQL

Proceedings of the 16th International Conference on Database Theory

Quantified Score

Hi-index	0.00

Visualization

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 situations 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); inflamatory versus noninflationary iteration; the relationship with logics that have the ability to count; and nested versus unnested loops. Copyright 2001 Academic Press.