{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:22Z","timestamp":1753894402610,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The logic of information flows (LIF) has recently been proposed as a general\nframework in the field of knowledge representation. In this framework, tasks of\nprocedural nature can still be modeled in a declarative, logic-based fashion.\nIn this paper, we focus on the task of query processing under limited access\npatterns, a well-studied problem in the database literature. We show that LIF\nis well-suited for modeling this task. Toward this goal, we introduce a variant\nof LIF called \"forward\" LIF (FLIF), in a first-order setting. FLIF takes a\nnovel graph-navigational approach; it is an XPath-like language that\nnevertheless turns out to be equivalent to the \"executable\" fragment of\nfirst-order logic defined by Nash and Lud\\\"ascher. One can also classify the\nvariables in FLIF expressions as inputs and outputs. Expressions where inputs\nand outputs are disjoint, referred to as io-disjoint FLIF expressions, allow a\nparticularly transparent translation into algebraic query plans that respect\nthe access limitations. Finally, we show that general FLIF expressions can\nalways be put into io-disjoint form.<\/jats:p>","DOI":"10.46298\/lmcs-20(2:6)2024","type":"journal-article","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T14:25:08Z","timestamp":1716387908000},"source":"Crossref","is-referenced-by-count":0,"title":["Executable First-Order Queries in the Logic of Information Flows"],"prefix":"10.46298","volume":"Volume 20, Issue 2","author":[{"given":"Heba","family":"Aamer","sequence":"first","affiliation":[]},{"given":"Bart","family":"Bogaerts","sequence":"additional","affiliation":[]},{"given":"Dimitri","family":"Surinx","sequence":"additional","affiliation":[]},{"given":"Eugenia","family":"Ternovska","sequence":"additional","affiliation":[]},{"given":"Jan Van den","family":"Bussche","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2024,5,22]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/13646\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/13646\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T14:25:08Z","timestamp":1716387908000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/10121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,22]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-20(2:6)2024","relation":{"has-preprint":[{"id-type":"arxiv","id":"2210.00240v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2210.00240v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2210.00240v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2210.00240","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2210.00240","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2024,5,22]]},"article-number":"10121"}}