Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/36489
Title: | Inputs, Outputs, and Composition in the Logic of Information Flows | Authors: | AAMER, Heba Bogaerts, Bart Ternovska, Eugenia SURINX, Dimitri VAN DEN BUSSCHE, Jan |
Issue Date: | 2020 | Publisher: | IJCAI-INT JOINT CONF ARTIF INTELL | Source: | Calvanese, D, Erdem, E, Thielscher, M, (Ed.). Hide Web of Science ResearcherID and ORCID, IJCAI-INT JOINT CONF ARTIF INTELL, p. 2 -11 | 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 paper 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. | Notes: | Aamer, H (corresponding author), Univ Hasselt, Hasselt, Belgium. heba.mohamed@uhasselt.be; bart.bogaerts@vub.be; dimitri.surinx@uhasselt.be; ter@sfu.ca; jan.vandenbussche@uhasselt.be |
Document URI: | http://hdl.handle.net/1942/36489 | ISBN: | 978-0-9992411-7-2 | ISI #: | WOS:000720083100001 | Rights: | 2020 International Joint Conferences on Artificial Intelligence Organization | Category: | C1 | Type: | Proceedings Paper | Validations: | ecoom 2022 |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Inputs, Outputs, and Composition in the Logic of Information Flows.pdf Restricted Access | Peer-reviewed author version | 190.59 kB | Adobe PDF | View/Open Request a copy |
arXiv_2209.06448v1 [cs.LO] 14 Sep 2022.pdf | Non Peer-reviewed author version | 437.83 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.