Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/652
Title: Adding For-Loops to First-Order Logic
Authors: NEVEN, Frank 
Otto, M
Tyszkiewicz, J.
VAN DEN BUSSCHE, Jan 
Issue Date: 2001
Publisher: Elsevier, Inc., 525 B Street, Suite 1900, San Diego CA 9201--4495.
Source: Information and Computation, 168(2). p. 156-186
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 noninflationary iteration; the relationship with logics that have the ability to count; and nested versus unnested loops.
Document URI: http://hdl.handle.net/1942/652
ISSN: 0890-5401
e-ISSN: 1090-2651
DOI: 10.1006/inco.2000.2961
ISI #: 000170174600005
Category: A1
Type: Journal Contribution
Validations: ecoom 2002
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
forfull.pdf495.7 kBAdobe PDFView/Open
Show full item record

SCOPUSTM   
Citations

3
checked on Sep 2, 2020

WEB OF SCIENCETM
Citations

2
checked on May 29, 2022

Page view(s)

62
checked on May 28, 2022

Download(s)

86
checked on May 28, 2022

Google ScholarTM

Check

Altmetric


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