Results 21 to 30 of about 1,530,272 (312)
A Van Benthem Theorem for Modal Team Semantics [PDF]
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 +7 more sources
Team semantics for interventionist counterfactuals and causal dependence [PDF]
, 2017 We introduce a generalization of team semantics which provides a framework for manipulationist theories of causation based on structural equation models, such as Woodward's and Pearl's; our causal teams incorporate (partial or total) information about ...
Fausto Barbero, Gabriel Sandu
core +6 more sources
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 +7 more sources
Tractability Frontiers in Probabilistic Team Semantics and Existential Second-Order Logic over the Reals [PDF]
European Conference on Logics in Artificial Intelligence, 2021 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 for Interventionist Counterfactuals: Observations vs. Interventions [PDF]
Journal of Philosophical Logic, 2020 Team semantics is a highly general framework for logics which describe dependencies and independencies among variables. Typically, the (in)dependencies considered in this context are properties of sets of configurations or data records.
Fausto Barbero, G. Sandu
semanticscholar +3 more sources
There are (other) ways to negate in propositional team semantics [PDF]
arXiv.orgThe languages of logics based on team semantics typically only allow atomic negation or restricted negation. In this paper, we explore propositional team-based logics with full (intuitionistic) negation.
Fan Yang
openalex +2 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
Team Semantics and Recursive Enumerability [PDF]
, 2014 It is well known that dependence logic captures the complexity class NP, and it has recently been shown that inclusion logic captures P on ordered models.
Kuusisto, Antti
core +2 more sources
Complexity Results in Team Semantics: Nonemptiness Is Not So Complex [PDF]
arXiv.orgWe initiate the study of the complexity-theoretic properties of convex logics in team semantics. We focus on the extension of classical propositional logic with the nonemptiness atom NE, a logic known to be both convex and union closed.
A. Anttila, Juha Kontinen, Fan Yang
openalex +2 more sources
Characterizing Relative Frame Definability in Team Semantics via the Universal Modality [PDF]
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
openalex +2 more sources