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 | Source: | DATABASE THEORY - ICDT'99. p. 58-69 | Series/Report: | LECTURE NOTES IN COMPUTER SCIENCE | Series/Report no.: | 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. | Document URI: | http://hdl.handle.net/1942/629 | ISI #: | 000082775200005 | Type: | Journal Contribution | Validations: | ecoom 2000 |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
07 Adding for Loops to first order logic.pdf | 495.67 kB | Adobe PDF | View/Open |
WEB OF SCIENCETM
Citations
2
checked on Oct 14, 2024
Page view(s)
110
checked on Sep 7, 2022
Download(s)
214
checked on Sep 7, 2022
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.