Abstract
We define a variant of team semantics called multiteam semantics based on multisets and study the properties of various logics in this framework. In particular, we define natural probabilistic versions of inclusion and independence atoms and certain approximation operators motivated by approximate dependence atoms of Väänänen.
Cite
CITATION STYLE
Durand, A., Hannula, M., Kontinen, J., Meier, A., & Virtema, J. (2016). Approximation and dependence via multiteam semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9616, pp. 271–291). Springer Verlag. https://doi.org/10.1007/978-3-319-30024-5_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
