Library

Approximation and dependence via multiteam semantics

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.

MathematicsComputer Science
View graphSource

Paper

References (54)

01Approximation and dependence via multiteam semanticsArnaud Durand, Miika Hannula, J. Kontinen et al.2018 · Annals of Mathematics and Artificial Intelligence · 1 citation
02Model Checking and Validity in Propositional and Modal Inclusion LogicsL. Hella, Antti Kuusisto, A. Meier et al.2016 · International Symposium on Mathematical Foundations of Computer Science · 22 citations
03A Logical Approach to Context-Specific IndependenceJ. Corander, Antti Hyttinen, J. Kontinen et al.2016 · Workshop on Logic, Language, Information and Computation · 40 citations
04On the finite and general implication problems of independence atoms and keysMiika Hannula, J. Kontinen, S. Link2016 · Journal of computer and system sciences (Print) · 20 citations
05Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositionsS. Link2015 · Theoretical Computer Science · 4 citations
06A logic for arguing about probabilities in measure teamsTapani Hyttinen, G. Paolini, J. Väänänen2015 · Archive for Mathematical Logic · 23 citations
07A Team Based Variant of CTLAndreas Krebs, A. Meier, Jonni Virtema2015 · Time · 22 citations
08Complexity of Propositional Independence and Inclusion LogicMiika Hannula, J. Kontinen, Jonni Virtema et al.2015 · International Symposium on Mathematical Foundations of Computer Science · 21 citations
09Tractability Frontier of Data Complexity in Team SemanticsArnaud Durand, J. Kontinen, Nicolas de Rugy-Altherre et al.2015 · International Symposium on Games, Automata, Logics and Formal Verification · 16 citations
10Propositional logics of dependenceFan Yang, J. Väänänen2014 · Annals of Pure and Applied Logic · 94 citations
11Pulling Conjunctive Query Equivalence out of the BagS. Böttcher, S. Link, Lin Zhang2014 · International Conference on Information and Knowledge Management · 3 citations
12On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statementsM. Gyssens, Mathias Niepert, D. V. Gucht2014 · Information Processing Letters · 20 citations

Scroll for more · 38 remaining

Similar papers

Logics with Multiteam SemanticsGr\"adel, Erich, Richard Wilke2020 · arXiv (Cornell University) In Library
Logics with Multiteam SemanticsErich Grädel, Richard Wilke2022 · ACM Transactions on Computational Logic In Library
Polyteam semanticsMiika Hannula, Juha Kontinen, Jonni Virtema2020 · Journal of Logic and Computation In Library
On elementary logics for quantitative dependenciesMiika Hannula, Minna Hirvonen, Juha Kontinen2022 · Annals of Pure and Applied Logic In Library
Doubly strongly first-order dependenciesPietro Galliani2024 · Journal of Logic and Computation In Library
TEAM SEMANTICS AND INDEPENDENCE NOTIONS IN QUANTUM PHYSICSSamson Abramsky, Joni Puljujärvi, Jouko Väänánen2025 · Bulletin of Symbolic Logic In Library
On definability of team relations with k-invariant atomsRaine Rönnholm2022 · Annals of Pure and Applied Logic In Library
Facets of Distribution Identities in Probabilistic Team SemanticsMiika Hannula, Åsa Hirvonen, J. Kontinen et al.2018 · European Conference on Logics in Artificial Intelligence · 26 citations In Library
Unified Foundations of Team Semantics via SemiringsTimon Barlag, Miika Hannula, Juha Kontinen et al.2023 In Library
Unified Foundations of Team Semantics via SemiringsTimon Barlag, Miika Hannula, Juha Kontinen et al.2023 · arXiv (Cornell University) In Library
© 2026 NYSGPT2525 LLC