Descriptive complexity of real computation and probabilistic independence logic
We introduce a novel variant of BSS machines called Separate Branching BSS machines (S-
BSS in short) and develop a Fagin-type logical characterisation for languages decidable in …
BSS in short) and develop a Fagin-type logical characterisation for languages decidable in …
Team logic: axioms, expressiveness, complexity
M Lück - 2020 - repo.uni-hannover.de
Team semantics is an extension of classical logic where statements do not refer to single
states of a system, but instead to sets of such states, called teams. This kind of semantics …
states of a system, but instead to sets of such states, called teams. This kind of semantics …
Facets of distribution identities in probabilistic team semantics
We study probabilistic team semantics which is a semantical framework allowing the study of
logical and probabilistic dependencies simultaneously. We examine and classify the …
logical and probabilistic dependencies simultaneously. We examine and classify the …
A bunched logic for conditional independence
Independence and conditional independence are fundamental concepts for reasoning
about groups of random variables in probabilistic programs. Verification methods for …
about groups of random variables in probabilistic programs. Verification methods for …
[HTML][HTML] A logical approach to context-specific independence
Directed acyclic graphs (DAGs) constitute a qualitative representation for conditional
independence (CI) properties of a probability distribution. It is known that every CI statement …
independence (CI) properties of a probability distribution. It is known that every CI statement …
Linear-time temporal logic with team semantics: Expressivity and complexity
We study the expressivity and complexity of model checking linear temporal logic with team
semantics (TeamLTL). TeamLTL, despite being a purely modal logic, is capable of defining …
semantics (TeamLTL). TeamLTL, despite being a purely modal logic, is capable of defining …
The existential theory of the reals with summation operators
M Bläser, J Dörfler, M Liskiewicz… - arXiv preprint arXiv …, 2024 - arxiv.org
To characterize the computational complexity of satisfiability problems for probabilistic and
causal reasoning within the Pearl's Causal Hierarchy, arXiv: 2305.09508 [cs. AI] introduce a …
causal reasoning within the Pearl's Causal Hierarchy, arXiv: 2305.09508 [cs. AI] introduce a …
On dependence logic
P Galliani, J Väänänen - Johan van Benthem on logic and information …, 2014 - Springer
Dependence logic extends the language of first order logic by means of dependence atoms
and aims to establish a basic theory of dependence and independence underlying such …
and aims to establish a basic theory of dependence and independence underlying such …
Unified foundations of team semantics via semirings
Semiring semantics for first-order logic provides a way to trace how facts represented by a
model are used to deduce satisfaction of a formula. Team semantics is a framework for …
model are used to deduce satisfaction of a formula. Team semantics is a framework for …
[HTML][HTML] Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals
Probabilistic team semantics is a framework for logical analysis of probabilistic
dependencies. Our focus is on the axiomatizability, complexity, and expressivity of …
dependencies. Our focus is on the axiomatizability, complexity, and expressivity of …