On elementary logics for quantitative dependencies |
| |
Institution: | Department of Mathematics and Statistics, University of Helsinki, Helsinki, Finland |
| |
Abstract: | We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under the Boolean negation. Our logics employ new probabilistic atoms that resemble so-called extended atoms from the team semantics literature. We also define counterparts of our logics over metafinite structures and show that all of our logics can be translated into functional fixed point logic implying a polynomial time upper bound for data complexity with respect to BSS-computations. |
| |
Keywords: | Probabilistic team semantics Dependence logic Conditional independence Metafinite structures |
本文献已被 ScienceDirect 等数据库收录! |