Inputs, Outputs, and Composition in the Logic of Information Flows
Authors: 
Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, 
Jan Van den BusscheAuthors Info & Claims
Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den BusscheAuthors Info & ClaimsArticle No.: 33, Pages 1 - 44
Abstract
The logic of information flows (LIF) is a general framework in which tasks of a procedural nature can be modeled in a declarative, logic-based fashion. The first contribution of this article is to propose semantic and syntactic definitions of inputs and outputs of LIF expressions. We study how the two relate and show that our syntactic definition is optimal in a sense that is made precise. The second contribution is a systematic study of the expressive power of sequential composition in LIF. Our results on composition tie in the results on inputs and outputs and relate LIF to first-order logic (FO) and bounded-variable LIF to bounded- variable FO.
This article is the extended version of a paper presented at KR 2020 [2].
References
[1]
Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, and Jan Van den Bussche. 2020. Executable first-order queries in the logic of information flows. In Proceedings of the 23rd International Conference on Database Theory(Leibniz International Proceedings in Informatics, Vol. 155). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 4:1–4:14.
[2]
Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, and Jan Van den Bussche. 2020. Inputs, outputs, and composition in the logic of information flows. In Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning. 2–11. DOI:
[3]
Natasha Alechina, Tomás Brázdil, Giuseppe De Giacomo, Paolo Felli, Brian Logan, and Moshe Y. Vardi. 2019. Unbounded orchestrations of transducers for manufacturing. In AAAI Conference on Artificial Intelligence. AAAI Press, 2646–2653.
[4]
Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Massimo Mecella, and Fabio Patrizi. 2008. Automatic service composition and synthesis: The Roman model. IEEE Data Eng. Bull. 31, 3 (2008), 18–22.
[5]
Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. 2016. Regular open APIs. In Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning.AAAI Press, 329–338.
[6]
Giuseppe De Giacomo, Fabio Patrizi, and Sebastian Sardiña. 2013. Automatic behavior composition synthesis. Artif. Intell. 196 (2013), 106–142.
[7]
Heinz-Dieter Ebbinghaus and Jörg Flum. 1999. Finite Model Theory (2nd ed.). Springer.
[8]
Herbert B. Enderton. 1972. A Mathematical Introduction to Logic. Academic Press.
[9]
Wenfei Fan, Floris Geerts, and Leonid Libkin. 2014. On scale independence for querying big data. In Proceedings of the 33rd ACM Symposium on Principles of Database Systems. ACM, 51–62.
[10]
George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, and Yuqing Wu. 2015. Relative expressive power of navigational querying on graphs. Inf. Sci. 298 (2015), 390–406.
[11]
Daniel Fontaine, Laurent Michel, and Pascal Van Hentenryck. 2013. Model combinators for hybrid optimization. In Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming. Springer, 299–314.
[12]
Jeroen Groenendijk and Martin Stokhof. 1991. Dynamic predicate logic. Ling. Philos. 14 (1991), 39–100.
[13]
Yuri Gurevich. 1983. Algebras of feasible functions. In Proceedings of the 24th Symposium on Foundations of Computer Science. IEEE Computer Society, 210–214.
[14]
Yuri Gurevich. 1988. Logic and the challenge of computer science. In Current Trends in Theoretical Computer Science, E. Börger (Ed.). Computer Science Press, 1–57.
[15]
Leon Henkin, J. Donald Monk, and Alfred Tarski. 1971. Cylindric Algebras. Part I.North-Holland.
[16]
Tomasz Imieliński and Witold Lipski. 1984. The relational model of data and cylindric algebras. J. Comput. Syst. Sci. 28 (1984), 80–102.
[17]
Gabriel M. Kuper, Leonid Libkin, and Jan Paredaens (Eds.). 2000. Constraint Databases. Springer.
[18]
David Lewis. 1973. Causation. J. Philos. 70 (1973), 556–567.
[19]
Vladimir Lifschitz. 1987. Formal theories of action (preliminary report). In Proceedings of the 10th International Joint Conference on Artificial Intelligence, John P. McDermott (Ed.). Morgan Kaufmann, 966–972. Retrieved from http://ijcai.org/Proceedings/87-2/Papers/081.pdf
[20]
John McCarthy and Patrick J. Hayes. 1969. Some philosophical problems from the standpoint of artificial intelligence. In Machine Intelligence 4, B. Meltzer and D. Michie (Eds.). Edinburgh University Press, 463–502.
[21]
Sheila Mcilraith, Tran Son, and Honglei Zeng. 2001. Semantic web services. IEEE Intell. Syst. 16 (042001), 46–53.
[22]
David G. Mitchell and Eugenia Ternovska. 2005. A framework for representing and solving NP search problems. In Proceedings of the AAAI Conference on Artificial Intelligence. AAAI Press/The MIT Press, 430–435.
[23]
Alfred Tarski. 1941. On the calculus of relations. J. Symbol. Log. 6 (1941), 73–89.
[24]
Eugenia Ternovska. 2015. An algebra of combined constraint solving. In Proceedings of the Global Conference on Artificial Intelligence. EasyChair, 275–295.
[25]
Eugenia Ternovska. 2017. Recent progress on the algebra of modular systems. In Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management(CEUR Workshop Proceedings, Vol. 1912), J. L. Reutter and D. Srivastava (Eds.). CEUR-WS.org.
[26]
Eugenia Ternovska. 2019. An algebra of modular systems: Static and dynamic perspectives. In Proceedings of the 12th Frontiers of Combining Systems Conference(Lecture Notes in Artificial Intelligence, Vol. 11715), A. Herzig and A. Popescu (Eds.). Springer, 94–111.
Index Terms
- Inputs, Outputs, and Composition in the Logic of Information Flows
Recommendations
On the Completeness of Dynamic Logic
Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures - Volume 5504The impossibility of semantically complete deductive calculi for logics for imperative programs has led to the study of two alternative approaches to completeness: "local" semantic completeness on the one hand Cook's relative completeness, Harel's ...
Hybrid Logic Meets IF Modal Logic
The hybrid logic $${\mathcal{H}(@,\downarrow)}$$ and the independence friendly modal logic IFML are compared for their expressive powers. We introduce a logic IFML c having a non-standard syntax and a compositional semantics; in terms of this logic a syntactic fragment of IFML ...
A Dynamic Logic-Based Modal Prolog
MICAI '12: Proceedings of the 2012 11th Mexican International Conference on Artificial IntelligenceThe field of modal logic programming has been developed to extend the expressiveness of logic programming. By introducing the modal operators of necessity and possibility within the language of Horn clauses, modal logic programming languages retain its ...
Comments
Information & Contributors
Information
Published In
October 2023
243 pages
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 25 August 2023
Online AM: 15 July 2023
Accepted: 04 May 2023
Revised: 18 February 2023
Received: 14 September 2022
Published in TOCL Volume 24, Issue 4
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Flemish Government under the “Onderzoeksprogramma Artificiële Intelligentie (AI) Vlaanderen” programme
- Natural Sciences and Engineering Research Council of Canada (NSERC)
- National Natural Science Foundation of China
- Special Research Fund (BOF)
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 119Total Downloads
- Downloads (Last 12 months)32
- Downloads (Last 6 weeks)0
Reflects downloads up to 02 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in