www.uhasselt.be
DSpace

Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/629

Title: Adding For-Loops to First-Order Logic
Authors: NEVEN, Frank
Otto, M
Tyszkiewicz, J.
VAN DEN BUSSCHE, Jan
Issue Date: 1999
Publisher: Springer-Verlag GmbH
Citation: DATABASE THEORY - ICDT'99. p. 58-69
Series/Report: LECTURE NOTES IN COMPUTER SCIENCE, 1540
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.
URI: http://hdl.handle.net/1942/629
ISI #: 000082775200005
ISSN: 0302-9743
Type: Journal Contribution
Validation: ecoom, 2000
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
N/A495.67 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.