Approximation and dependence via multiteam semantics

From MaRDI portal
Publication:2807084

DOI10.1007/978-3-319-30024-5_15zbMATH Open1459.03031DBLPconf/foiks/0001HKMV16arXiv1510.09040OpenAlexW2962881322WikidataQ57998265 ScholiaQ57998265MaRDI QIDQ2807084FDOQ2807084


Authors: Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema Edit this on Wikidata


Publication date: 19 May 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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"a"an"anen.


Full work available at URL: https://arxiv.org/abs/1510.09040




Recommendations




Cited In (10)





This page was built for publication: Approximation and dependence via multiteam semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807084)