Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning 2020
DOI: 10.24963/kr.2020/1
|View full text |Cite
|
Sign up to set email alerts
|

Inputs, Outputs, and Composition in the Logic of Information Flows

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 of this paper is a systematic study of the expressive power of sequential composition in LIF. Our re… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(12 citation statements)
references
References 20 publications
0
9
0
Order By: Relevance
“…An important future extension of our work would be to the Unions of Conjunctive Compound Modules, using Sagiv-Yannakakis theorem (Sagiv and Yannakakis 1980). We would also like to prove a Containment property for an efficient restriction of a dynamic version of the algebra (Ternovska 2019), where inputs and outputs of modules are specified, similarly to (Aamer et al 2020a) and (Aamer et al 2020b).…”
Section: Discussionmentioning
confidence: 96%
“…An important future extension of our work would be to the Unions of Conjunctive Compound Modules, using Sagiv-Yannakakis theorem (Sagiv and Yannakakis 1980). We would also like to prove a Containment property for an efficient restriction of a dynamic version of the algebra (Ternovska 2019), where inputs and outputs of modules are specified, similarly to (Aamer et al 2020a) and (Aamer et al 2020b).…”
Section: Discussionmentioning
confidence: 96%
“…The syntax allows only one such (free) variable per an algebraic expression. 3 of all relational τ -structures over the same finite domain. We require that P, Q ∈ τ reg .…”
Section: Algebra: Syntaxmentioning
confidence: 99%
“…It outputs only the longest, in terms of the number of f -steps, transition out of all possible transitions from the same state produced by the Kleene star. 4 Binary op 2 : F 2 → F (partial mappings on strings in U + that depend on two functions): op 2 ∈ {;, ⊔} These operations take two functions as arguments, and combine them to obtain a (partial) mapping on U + . Sequential Composition (f ;g)(x) is the standard function composition g(f (x)).…”
Section: Algebra: Syntaxmentioning
confidence: 99%
See 2 more Smart Citations