Approximation and dependence via multiteam semantics
From MaRDI portal
Publication:1783737
DOI10.1007/s10472-017-9568-4zbMath1459.03032OpenAlexW2790871383WikidataQ57998253 ScholiaQ57998253MaRDI QIDQ1783737
Arnaud Durand, Juha Kontinen, Miika Hannula, Arne Meier, Jonni Virtema
Publication date: 21 September 2018
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10138/239804
Other nonclassical logic (03B60) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
On elementary logics for quantitative dependencies ⋮ On the Presburger fragment of logics with multiteam semantics ⋮ Parameterized complexity of propositional inclusion and independence logic ⋮ Unnamed Item ⋮ Approximate kernel partial least squares ⋮ Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals ⋮ Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals ⋮ Parameterised complexity of model checking and satisfiability in propositional dependence logic ⋮ Complexity thresholds in inclusion logic ⋮ The implication problem for functional dependencies and variants of marginal distribution equivalences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the finite and general implication problems of independence atoms and keys
- Propositional logics of dependence
- Complexity of two-variable dependence logic and IF-logic
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Approximate inference of functional dependencies from relations
- Some simplified NP-complete graph problems
- Dependence and independence
- Lottery semantics: a compositional semantics for probabilistic first-order logic with imperfect information
- Epistemic operators in dependence logic
- Coherence and computational complexity of quantifier-free dependence logic formulas
- On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
- A logic for arguing about probabilities in measure teams
- A finite axiomatization of conditional independence and inclusion dependencies
- Extended Modal Dependence Logic $\mathcal{EMDL}$
- Independence in Database Relations
- Complexity of Propositional Independence and Inclusion Logic
- Hierarchies in independence logic
- The Logic of Approximate Dependence
- Encyclopedia of Database Systems
- QUANTUM TEAM LOGIC AND BELL’S INEQUALITIES
- Compositional semantics for a language of imperfect information
- Decidability of predicate logics with team semantics
- Hierarchies in independence and inclusion logic with strict semantics
- A Van Benthem Theorem for Modal Team Semantics
This page was built for publication: Approximation and dependence via multiteam semantics
