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 a 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, in a first-order setting. We define FLIFio, a syntactical fragment of forward LIF, and show that it corresponds exactly to the “executable” fragment of first-order logic defined by Nash and Ludäscher. The definition of FLIFio involves a classification of the free variables of an expression into “input” and “output” variables. Our result hinges on inertia and determinacy laws for forward LIF expressions, which are interesting in their own right. These laws are formulated in terms of the input and output variables.
Original language | English |
---|---|
Title of host publication | 23rd International Conference on Database Theory (ICDT 2020) |
Editors | Carsten Lutz, Christoph Jung |
Pages | 4:1-4:14 |
Number of pages | 14 |
Volume | 155 |
ISBN (Electronic) | 978-3-95977-139-9} |
DOIs | |
Publication status | Published - 2020 |
Event | 23rd International Conference on Database Theory (ICDT 2020) - Copenhagen, Denmark Duration: 30 Mar 2020 → 2 Apr 2020 Conference number: 23 https://diku-dk.github.io/edbticdt2020/ |
Publication series
Name | Leibniz International Proceedings in Informatics (LIPIcs) |
---|---|
Publisher | Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik |
Volume | 155 |
ISSN (Print) | 1868-8969 |
ISSN (Electronic) | 1868-8969 |
Conference
Conference | 23rd International Conference on Database Theory (ICDT 2020) |
---|---|
Abbreviated title | ICDT |
Country | Denmark |
City | Copenhagen |
Period | 30/03/20 → 2/04/20 |
Internet address |