Probabilistic Team Semantics

Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review


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 backslashmathrm NP NP -hard model checking problems.
Original languageEnglish
Title of host publicationFoundations of Information and Knowledge Systems
EditorsFlavio Ferrarotti, Stefan Woltran
Number of pages21
Place of PublicationCham
PublisherSpringer International Publishing
Publication date2018
ISBN (Print)978-3-319-90049-0
ISBN (Electronic)978-3-319-90050-6
Publication statusPublished - 2018
MoE publication typeA4 Article in conference proceedings
EventInternational Symposium on Foundations of Information and Knowledge Systems - Budapest, Hungary
Duration: 14 May 201818 May 2018
Conference number: 10

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fields of Science

  • 111 Mathematics
  • 113 Computer and information sciences

Cite this