Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/43086
Title: | Executable First-Order Queries in the Logic of Information Flows * | Authors: | Aamer, Heba A. Bogaerts , Bart SURINX, Dimitri Ternovska, Eugenia VAN DEN BUSSCHE, Jan |
Issue Date: | 2024 | Publisher: | LOGICAL METHODS COMPUTER SCIENCE E V | Source: | Logical Methods in Computer Science, 20 (2) | 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. | Notes: | Aamer, HA (corresponding author), Vrije Univ Brussel, Brussels, Belgium. heba.mohamed@vub.be; bart.bogaerts@vub.be; surinxd@gmail.com; ter@sfu.ca; jan.vandenbussche@uhasselt.be |
Keywords: | Limited access pattern;expressive power;variable substitution;composition. | Document URI: | http://hdl.handle.net/1942/43086 | ISSN: | 1860-5974 | e-ISSN: | 1860-5974 | DOI: | 10.46298/LMCS-20(2:6)2024 | ISI #: | 001230706900001 | 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 | Category: | A1 | Type: | Journal Contribution |
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.