Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data

DOI10.1007/978-3-319-31803-5_9MaRDI QIDQ5213646zbMATH OpenOpenAlexFDO

Authors Sebastian Link

Publication date 4 February 2020

Published in Dependence Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-31803-5_9

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Axioms; other general questions in probability (60A05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
• Propositional reasoning about saturated conditional probabilistic independence
• Probabilistic logic with conditional independence formulae
• Logics for approximating implication problems of saturated conditional independence
• Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty

Cites work

• An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
• An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
• An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
• Appropriate inferences of data dependencies in relational databases
• Characterisations of multivalued dependency implication over undetermined universes
• Characterising nested database dependencies by fragments of propositional logic
• Charting the completeness frontier of inference systems for multivalued dependencies
• Complexity results for modal dependence logic
• Correction to “An equivalence between relational database dependencies and a fragment of propositional logic”
• Corrigendum to ``On the undecidability of implications between embedded multivalued database dependencies
• Database relations with null values
• Dependence and independence
• Dependence logic. A new approach to independence friendly logic
• Dependence of variables construed as an atomic formula
• Functional dependencies and constraints on null values in database relations
• Functional Dependencies in a Relational Database and Propositional Logic
• Hierarchies in Dependence Logic
• scientific article; zbMATH DE number 4174350 (Why is no real title available?)
• scientific article; zbMATH DE number 41085 (Why is no real title available?)
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 176109 (Why is no real title available?)
• scientific article; zbMATH DE number 3635280 (Why is no real title available?)
• scientific article; zbMATH DE number 1950750 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Independence in database relations
• Logical and algorithmic properties of conditional independence and graphical models
• Logical and algorithmic properties of independence and their application to Bayesian networks
• Logical and algorithmic properties of stable conditional independence
• Logics for approximating implication problems of saturated conditional independence
• On a problem of Fagin concerning multivalued dependencies in relational databases
• On the conditional independence implication problem: a lattice-theoretic approach
• On the Equivalence of Database Models
• On the menbership problem for functional and multivalued dependencies in relational databases
• On the undecidability of implications between embedded multivalued database dependencies
• Propositional reasoning about saturated conditional probabilistic independence
• Reasoning about functional and full hierarchical dependencies over partial relations
• Semantic foundations of 4NF in relational database design
• Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
• Tractable reasoning via approximation

Cited in

(4)

• Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
• Propositional reasoning about saturated conditional probabilistic independence
• Logics for approximating implication problems of saturated conditional independence
• Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions

This page was built for publication: Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data

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