Document Open Access Logo

Executable First-Order Queries in the Logic of Information Flows

Authors Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche

PDF
Thumbnail PDF

File

LIPIcs.ICDT.2020.4.pdf
  • Filesize: 453 kB
  • 14 pages

Document Identifiers

Author Details

Heba Aamer
  • Universiteit Hasselt, Belgium
Bart Bogaerts
  • Vrije Universiteit Brussel, Belgium
Dimitri Surinx
  • Universiteit Hasselt, Belgium
Eugenia Ternovska
  • Simon Fraser University, Canada
Jan Van den Bussche
  • Universiteit Hasselt, Belgium

Funding

Jan Van den Bussche is partially supported by the National Natural Science Foundation of China (61972455). This research was partially supported by FWO project G0D9616N and by the Flanders AI Research Program.

Acknowledgements

We thank the ICDT reviewers for pointing out the connection to related work [W. Fan et al., 2014; J. Groenendijk and M. Stokhof, 1991].

Cite As Get BibTex

Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, and Jan Van den Bussche. Executable First-Order Queries in the Logic of Information Flows. In 23rd International Conference on Database Theory (ICDT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 155, pp. 4:1-4:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020) https://doi.org/10.4230/LIPIcs.ICDT.2020.4

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 FLIF^io, 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 FLIF^io 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.

Subject Classification

ACM Subject Classification
  • Information systems → Query languages
  • Computing methodologies → Knowledge representation and reasoning
Keywords
  • Logic of Information Flows
  • Limited access pattern
  • Executable first-order logic

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Supplementary Materials

References

  1. S. Abiteboul, O. Benjelloun, and T. Milo. The Active XML project: an overview. The VLDB Journal, 17(5):1019-1040, 2008. Google Scholar
  2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google Scholar
  3. R. Angles, M. Arenas, P. Barceló, A. Hogan, J. Reutter, and D. Vrgoč. Foundations of modern query languages for graph databases. ACM Computing Surveys, 50(5):68:1-68:40, 2017. Google Scholar
  4. R. Angles, P. Barceló, and G. Rios. A practical query language for graph DBs. In L. Bravo and M. Lenzerini, editors, Proceedings 7th Alberto Mendelzon International Workshop on Foundations of Data Management, volume 1087 of CEUR Workshop Proceedings, 2013. Google Scholar
  5. M. Benedikt, J. Leblay, B. ten Cate, and E. Tsamoura. Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation. Morgan & Claypool, 2016. Google Scholar
  6. M. Benedikt, B. ten Cate, and E. Tsamoura. Generating plans from proofs, 2016. Google Scholar
  7. A. Cali, D. Calvanese, and D. Martinenghi. Dynamic query optimization under access limitations and dependencies. Journal of Universal Computer Science, 15(1):33-62, 2009. Google Scholar
  8. A. Cali, D. Martinenghi, I. Razon, and M. Ugarte. Querying the deep web: Back to the foundations. In J.L. Reutter and D. Srivastava, editors, Proceedings 11th Alberto Mendelzon International Workshop on Foundations of Data Management, volume 1912 of CEUR Workshop Proceedings, 2017. Google Scholar
  9. A. Calì and M. Ugarte. On the complexity of query answering under access limitations: A computational formalism. In D. Olteanu and B. Poblete, editors, Proceedings 12th Alberto Mendelzon International Workshop on Foundations of Data Management, volume 2100 of CEUR Workshop Proceedings, 2018. Google Scholar
  10. W. Fan, F. Geerts, and L. Libkin. On scale independence for querying big data. In Proceedings 33th ACM Symposium on Principles of Database Systems, pages 51-62, 2014. Google Scholar
  11. G.H.L. Fletcher, M. Gyssens, D. Leinders, D. Surinx, J. Van den Bussche, D. Van Gucht, S. Vansummeren, and Y. Wu. Relative expressive power of navigational querying on graphs. Information Sciences, 298:390-406, 2015. Google Scholar
  12. J. Groenendijk and M. Stokhof. Dynamic predicate logic. Linguistics and Philosophy, 14:39-100, 1991. Google Scholar
  13. D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. MIT Press, 2000. Google Scholar
  14. L. Libkin, W. Martens, and D. Vrgoč. Quering graph databases with XPath. In Proceedings 16th International Conference on Database Theory. ACM, 2013. Google Scholar
  15. A. Nash and B. Ludäscher. Processing first-order queries under limited access patterns. In Proceedings 23th ACM Symposium on Principles of Database Systems, pages 307-318, 2004. Google Scholar
  16. J. Pérez, M. Arenas, and C. Gutierrez. nSPARQL: A navigational language for RDF. Journal of Web Semantics, 8(4):255-270, 2010. Google Scholar
  17. D. Surinx, G.H.L. Fletcher, M. Gyssens, D. Leinders, J. Van den Bussche, D. Van Gucht, S. Vansummeren, and Y. Wu. Relative expressive power of navigational querying on graphs using transitive closure. Logic Journal of the IGPL, 23(5):759-788, 2015. Google Scholar
  18. E. Ternovska. Recent progress on the algebra of modular systems. In J.L. Reutter and D. Srivastava, editors, Proceedings 11th Alberto Mendelzon International Workshop on Foundations of Data Management, volume 1912 of CEUR Workshop Proceedings, 2017. Google Scholar
  19. E. Ternovska. An algebra of modular systems: static and dynamic perspectives. In A. Herzig and A. Popescu, editors, Frontiers of Combining Systems: Proceedings 12th FroCos, volume 11715 of Lecture Notes in Artificial Intelligence, pages 94-111. Springer, 2019. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact