Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/43086
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Aamer, Heba A. | - |
dc.contributor.author | Bogaerts , Bart | - |
dc.contributor.author | SURINX, Dimitri | - |
dc.contributor.author | Ternovska, Eugenia | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.date.accessioned | 2024-06-10T07:44:08Z | - |
dc.date.available | 2024-06-10T07:44:08Z | - |
dc.date.issued | 2024 | - |
dc.date.submitted | 2024-06-10T07:18:06Z | - |
dc.identifier.citation | Logical Methods in Computer Science, 20 (2) | - |
dc.identifier.uri | http://hdl.handle.net/1942/43086 | - |
dc.description.abstract | . The logic of information flows (LIF) has recently been proposed as a general framework in the field of knowledge representation. In this framework, tasks of procedural nature can still be modeled in a declarative, logic-based fashion. In this paper, we focus on the task of query processing under limited access patterns, a well-studied problem in the database literature. We show that LIF is well-suited for modeling this task. Toward this goal, we introduce a variant of LIF called "forward" LIF (FLIF), in a first-order setting. FLIF takes a novel graph-navigational approach; it is an XPath-like language that nevertheless turns out to be equivalent to the "executable" fragment of first-order logic defined by Nash and Lud & acirc;scher. One can also classify the variables in FLIF expressions as inputs and outputs. Expressions where inputs and outputs are disjoint, referred to as iodisjoint FLIF expressions, allow a particularly transparent translation into algebraic query plans that respect the access limitations. Finally, we show that general FLIF expressions can always be put into io-disjoint form. | - |
dc.description.sponsorship | This research was partially supported by the Flanders AI Research Program. We thank the anonymous reviewers for their critical comments on an earlier version of this paper, which prompted us to significantly improve the presentation of our results. | - |
dc.language.iso | en | - |
dc.publisher | LOGICAL METHODS COMPUTER SCIENCE E V | - |
dc.rights | This work is licensed under the Creative Commons Attribution License. To view a copy of this license, visit https://creativecommons.org/licenses/by/4.0/ or send a letter to Creative Commons | - |
dc.subject.other | Limited access pattern | - |
dc.subject.other | expressive power | - |
dc.subject.other | variable substitution | - |
dc.subject.other | composition. | - |
dc.title | Executable First-Order Queries in the Logic of Information Flows * | - |
dc.type | Journal Contribution | - |
dc.identifier.issue | 2 | - |
dc.identifier.volume | 20 | - |
local.format.pages | 41 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.notes | Aamer, HA (corresponding author), Vrije Univ Brussel, Brussels, Belgium. | - |
dc.description.notes | heba.mohamed@vub.be; bart.bogaerts@vub.be; surinxd@gmail.com; | - |
dc.description.notes | ter@sfu.ca; jan.vandenbussche@uhasselt.be | - |
local.publisher.place | KLEISTSTR 22, BRAUNSCHWEIG, 38124, GERMANY | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.identifier.doi | 10.46298/LMCS-20(2:6)2024 | - |
dc.identifier.isi | 001230706900001 | - |
local.provider.type | wosris | - |
local.description.affiliation | [Aamer, Heba A.; Bogaerts, Bart] Vrije Univ Brussel, Brussels, Belgium. | - |
local.description.affiliation | [Surinx, Dimitri; Van Den Bussche, Jan] Hasselt Univ, Hasselt, Belgium. | - |
local.description.affiliation | [Ternovska, Eugenia] Simon Fraser Univ, Burnaby, BC, Canada. | - |
local.uhasselt.international | yes | - |
item.fullcitation | Aamer, Heba A.; Bogaerts , Bart; SURINX, Dimitri; Ternovska, Eugenia & VAN DEN BUSSCHE, Jan (2024) Executable First-Order Queries in the Logic of Information Flows *. In: Logical Methods in Computer Science, 20 (2). | - |
item.fulltext | With Fulltext | - |
item.contributor | Aamer, Heba A. | - |
item.contributor | Bogaerts , Bart | - |
item.contributor | SURINX, Dimitri | - |
item.contributor | Ternovska, Eugenia | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.accessRights | Open Access | - |
crisitem.journal.issn | 1860-5974 | - |
crisitem.journal.eissn | 1860-5974 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Executable First-Order Queries in the Logic of Information Flows.pdf | Non Peer-reviewed author version | 618.49 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.