Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/36202
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAAMER, Heba-
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.date.accessioned2021-12-15T10:57:06Z-
dc.date.available2021-12-15T10:57:06Z-
dc.date.issued2021-
dc.date.submitted2021-12-09T11:01:47Z-
dc.identifier.citationYi, Ke; Wei, Zhewei (Ed.). 24th International Conference on Database Theory (ICDT 2021), Schloss Dagstuhl, (Art N° 8)-
dc.identifier.isbn9783959771795-
dc.identifier.issn1868-8969-
dc.identifier.urihttp://hdl.handle.net/1942/36202-
dc.description.abstractLast year we introduced the logic FLIF (forward logic of information flows) as a declarative language for specifying complex compositions of information sources with limited access patterns. The key insight of this approach is to view a system of information sources as a graph, where the nodes are valuations of variables, so that accesses to information sources can be modeled as edges in the graph. This allows the use of XPath-like navigational graph query languages. Indeed, a well-behaved fragment of FLIF, called io-disjoint FLIF, was shown to be equivalent to the executable fragment of first-order logic. It remained open, however, how io-disjoint FLIF compares to general FLIF. In this paper we close this gap by showing that general FLIF expressions can always be put into io-disjoint form. 2012 ACM Subject Classification Software and its engineering → Semantics; Software and its engineering → Data flow languages; Theory of computation → Database query languages (principles)-
dc.description.sponsorshipThis work was partially supported by Artificial Intelligence Research Flanders. Heba Aamer: Supported by the Special Research Fund (BOF) (BOF19OWB16). Jan Van den Bussche: Partially supported by the National Natural Science Foundations of China (61972455).-
dc.language.isoen-
dc.publisherSchloss Dagstuhl-
dc.relation.ispartofseriesLeibniz International Proceedings in Informatics (LIPIcs)-
dc.rights© Heba Aamer and Jan Van den Bussche; licensed under Creative Commons License CC-BY 4.0 24th International Conference on Database Theory (ICDT 2021).-
dc.subject.otherexpressive power-
dc.subject.othervariable substitution-
dc.subject.otherComposition-
dc.titleInput–Output Disjointness for Forward Expressions in the Logic of Information Flows-
dc.typeProceedings Paper-
local.bibliographicCitation.authorsYi, Ke-
local.bibliographicCitation.authorsWei, Zhewei-
local.bibliographicCitation.conferencedateMarch 23 – 26, 2021-
local.bibliographicCitation.conferencename24th International Conference on Database Theory (ICDT 2021)-
local.bibliographicCitation.conferenceplaceNicosia, Cyprus-
dc.identifier.epage11-
dc.identifier.spage2-
local.format.pages18-
local.bibliographicCitation.jcatC1-
local.publisher.placeDagstuhl, Germany-
dc.relation.references1 H. Aamer, B. Bogaerts, D. Surinx, E. Ternovska, and J. Van den Bussche. Executable first-order queries in the logic of information flows. In C. Lutz and J.C. Jung, editors, Proceedings 23rd International Conference on Database Theory, volume 155 of Leibniz International Proceedings in Informatics, pages 4:1–4:14. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2020. 2 H. Aamer, B. Bogaerts, D. Surinx, E. Ternovska, and J. Van den Bussche. Inputs, outputs, and composition in the logic of information flows. In D. Calvanese, E. Erdem, and M. Thielscher, editors, Proceedings 17th International Conference on Principles of Knowledge Representation and Reasoning. IJCAI Organization, 2020. 3 H. Andréka, S. Givant, and I. Németi. Decision problems for equational theories of relation algebras, volume 126 of Memoirs of the American Mathematical Society. American Mathematical Society, 1997. 4 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. 5 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. 6 M. Bauderon and B. Courcelle. Graph expressions and graph rewritings. Mathematical Systems Theory, 20:83–127, 1987. 7 M. Benedikt, J. Leblay, B. ten Cate, and E. Tsamoura. Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation. Morgan & Claypool, 2016. 8 L. Cardelli, Ph. Gardner, and G. Ghelli. A spatial logic for querying graphs. In P. Widmayer et al., editors, Proceedings 29th International Colloquium on Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 597–610. Springer, 2002. 9 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. 10 L. Libkin, W. Martens, and D. Vrgoč. Quering graph databases with XPath. In W.-C. Tan et al., editors, Proceedings 16th International Conference on Database Theory, pages 129–140. ACM, 2013. 11 V. Lifschitz. Formal theories of action (preliminary report). In J.P. McDermott, editor, Proceedings 10th International Joint Conference on Artificial Intelligence, pages 966–972. Morgan Kaufmann, 1987. 12 J. McCarthy and P.J. Hayes. Some philosophical problems from the standpoint of artificial intelligence. In B. Meltzer and D. Michie, editors, Machine Intelligence 4, pages 463–502. Edinburgh University Press, 1969. 13 R. Milner. Communicating and Mobile Systems: The π-calculus. Cambridge University Press, 1999. 14 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. 15 J. Pérez, M. Arenas, and C. Gutierrez. nSPARQL: A navigational language for RDF. Journal of Web Semantics, 8(4):255–270, 2010. 16 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. 17 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. 18 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.-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
local.relation.ispartofseriesnr186-
local.bibliographicCitation.artnr8-
dc.identifier.doi10.4230/LIPIcs.ICDT.2021.8-
dc.identifier.urlhttps://drops.dagstuhl.de/opus/volltexte/2021/13716/-
local.provider.typePdf-
local.bibliographicCitation.btitleKR2020: PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING 24th International Conference on Database Theory (ICDT 2021)-
local.uhasselt.uhpubyes-
local.uhasselt.internationalno-
item.accessRightsOpen Access-
item.fulltextWith Fulltext-
item.contributorAAMER, Heba-
item.contributorVAN DEN BUSSCHE, Jan-
item.fullcitationAAMER, Heba & VAN DEN BUSSCHE, Jan (2021) Input–Output Disjointness for Forward Expressions in the Logic of Information Flows. In: Yi, Ke; Wei, Zhewei (Ed.). 24th International Conference on Database Theory (ICDT 2021), Schloss Dagstuhl, (Art N° 8).-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
LIPIcs-ICDT-2021-8.pdfPublished version707.73 kBAdobe PDFView/Open
Show simple item record

Page view(s)

50
checked on Sep 7, 2022

Download(s)

12
checked on Sep 7, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.