Probabilistic team semantics
Logic in Computer Science
2018-03-07 v1
Abstract
Team semantics is a semantical framework for the study of dependence and independence concepts ubiquitous in many areas such as databases and statistics. In recent works team semantics has been generalised to accommodate also multisets and probabilistic dependencies. In this article we study a variant of probabilistic team semantics and relate this framework to a Tarskian two-sorted logic. We also show that very simple quantifier-free formulae of our logic give rise to NP-hard model checking problems.
Cite
@article{arxiv.1803.02180,
title = {Probabilistic team semantics},
author = {Arnaud Durand and Miika Hannula and Juha Kontinen and Arne Meier and Jonni Virtema},
journal= {arXiv preprint arXiv:1803.02180},
year = {2018}
}