Results 21 to 30 of about 1,485,809 (311)
On the Complexity of Linear Temporal Logic with Team Semantics [PDF]
Theoretical Computer Science, 2020 A specification given as a formula in linear temporal logic (LTL) defines a system by its set of traces. However, certain features such as information flow security constraints are rather modeled as so-called hyperproperties, which are sets of sets of traces. One logical approach to this is team logic, which is a logical framework for the specification
Martin Lück
semanticscholar +8 more sources
A Van Benthem Theorem for Modal Team Semantics
Annual Conference for Computer Science Logic, 2014 The famous van Benthem theorem states that modal logic corresponds exactly to the fragment of first-order logic that is invariant under bisimulation. In this article we prove an exact analogue of this theorem in the framework of modal dependence logic ...
Juha Kontinen +3 more
semanticscholar +8 more sources
Logics with probabilistic team semantics and the Boolean negation [PDF]
European Conference on Logics in Artificial Intelligence, 2023 We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic independence logic with the Boolean negation, and a recently introduced ...
Miika Hannula +5 more
openalex +3 more sources
Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals [PDF]
European Conference on Logics in Artificial Intelligence, 2020 Probabilistic team semantics is a framework for logical analysis of probabilistic dependencies. Our focus is on the axiomatizability, complexity, and expressivity of probabilistic inclusion logic and its extensions.
Miika Hannula, Jonni Virtema
openalex +3 more sources
TEAM SEMANTICS AND INDEPENDENCE NOTIONS IN QUANTUM PHYSICS [PDF]
, 2021 We study dependence and independence concepts found in quantum physics, especially those related to hidden variables and non-locality, through the lens of team semantics and probabilistic team semantics, adapting a relational framework introduced by the ...
Samson Abramsky +2 more
openalex +2 more sources
Characterizing Relative Frame Definability in Team Semantics via the Universal Modality
Workshop on Logic, Language, Information and Computation, 2016 Let ML(U^+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We characterize the relative definability of ML(U^+) relative to finite transitive frames in the spirit of the ...
Katsuhiko Sano, Jonni Virtema
semanticscholar +6 more sources
Modular SAT-based techniques for reasoning tasks in team semantics [PDF]
Journal of computer and system sciences (Print), 2022 We study the complexity of reasoning tasks for logics in team semantics. Our main focus is on the data complexity of model checking but we also derive new results for logically defined counting and enumeration problems.
Arnaud Durand +2 more
openalex +3 more sources
The expressive power of modal logic with inclusion atoms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete characterisation for the
Lauri Hella, Johanna Stumpf
doaj +4 more sources
The Doxastic Interpretation of Team Semantics [PDF]
, 2013 We advance a doxastic interpretation for many of the logical connectives considered in Dependence Logic and in its extensions, and we argue that Team Semantics is a natural framework for reasoning about beliefs and belief ...
Pietro Galliani
openalex +4 more sources
Intermediate logics in the setting of team semantics
, 2022 Several authors have recently defined intuitionistic logic based on team semantics (tIPC). In this paper we provide two alternative approaches to intermediate logics in the team semantics setting. We do this by modifying tIPC with axioms written with two different versions of disjunction in the logic, a local one and global one.
Nick Bezhanishvili, Fan Yang
openalex +5 more sources