Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/634
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | GEERTS, Floris | - |
dc.contributor.author | KUIJPERS, Bart | - |
dc.date.accessioned | 2005-03-14T12:37:01Z | - |
dc.date.available | 2005-03-14T12:37:01Z | - |
dc.date.issued | 2003 | - |
dc.identifier.citation | DATABASE THEORY ICDT 2003, PROCEEDINGS. p. 190-206 | - |
dc.identifier.isbn | 0302-9743 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/1942/634 | - |
dc.description.abstract | We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by Boolean combinations of polynomial inequalities over the reals. We are in particular interested in deciding the termination of the evaluation of queries expressible in these transitive-closure logics. It turns out that termination is undecidable in general. However, we show that the termination of the transitive closure of a continuous function graph in the two-dimensional plane, viewed as a binary relation over the reals, is decidable, and even expressible in first-order logic over the reals. Based on this result, we identify a particular transitive-closure logic for which termination of query evaluation is decidable and which is more expressive than first-order logic over the reals. Furthermore, we can define a guarded fragment in which exactly the terminating queries of this language are expressible. | - |
dc.format.extent | 179509 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Springer-Verlag | - |
dc.relation.ispartofseries | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.title | Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases. | - |
dc.type | Journal Contribution | - |
local.bibliographicCitation.conferencename | DATABASE THEORY ICDT 2003, PROCEEDINGS | - |
dc.identifier.epage | 206 | - |
dc.identifier.spage | 190 | - |
local.bibliographicCitation.jcat | A1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
local.relation.ispartofseriesnr | 2572 | - |
dc.bibliographicCitation.oldjcat | A1 | - |
dc.identifier.isi | 000181548600013 | - |
item.fulltext | With Fulltext | - |
item.contributor | GEERTS, Floris | - |
item.contributor | KUIJPERS, Bart | - |
item.accessRights | Open Access | - |
item.fullcitation | GEERTS, Floris & KUIJPERS, Bart (2003) Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases.. In: DATABASE THEORY ICDT 2003, PROCEEDINGS. p. 190-206. | - |
item.validation | ecoom 2004 | - |
crisitem.journal.issn | 0302-9743 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
sdcql3.pdf | 175.3 kB | Adobe PDF | View/Open |
WEB OF SCIENCETM
Citations
2
checked on Apr 24, 2024
Page view(s)
92
checked on Nov 7, 2023
Download(s)
216
checked on Nov 7, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.