Probabilistic Team Semantics

被引：25
|
作者：
Durand, Arnaud [1 ]
Hannula, Miika [2 ]
Kontinen, Juha [3 ]
Meier, Arne [4 ]
Virtema, Jonni [5 ]
机构：
[1] Univ Paris Diderot, Inst Math Jussieu Paris Rive Gauche, CNRS UMR 7586, Paris, France
[2] Univ Auckland, Dept Comp Sci, Auckland, New Zealand
[3] Univ Helsinki, Dept Math & Stat, Helsinki, Finland
[4] Leibniz Univ Hannover, Inst Theoret Informat, Hannover, Germany
[5] Hasselt Univ, Databases & Theoret Comp Sci, Hasselt, Belgium
来源：
FOUNDATIONS OF INFORMATION AND KNOWLEDGE SYSTEMS, FOIKS 2018 | 2018年 / 10833卷
基金：
芬兰科学院;
关键词：
CONDITIONAL-INDEPENDENCE; LOGIC; DEPENDENCE; INCLUSION; FINITE;
D O I：
10.1007/978-3-319-90050-6_11
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
下载
收藏
页码：186 / 206
页数：21
相关论文
共 50 条
12345