Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data

DOI10.1007/978-3-319-31803-5_9zbMath1429.03093OpenAlexW2501042827MaRDI QIDQ5213646

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Appropriate inferences of data dependencies in relational databases
• Characterisations of multivalued dependency implication over undetermined universes
• Dependence of variables construed as an atomic formula
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Corrigendum to ``On the undecidability of implications between embedded multivalued database dependencies
• Logical and algorithmic properties of stable conditional independence
• Charting the completeness frontier of inference systems for multivalued dependencies
• Database relations with null values
• Semantic foundations of 4NF in relational database design
• Logical and algorithmic properties of conditional independence and graphical models
• Logical and algorithmic properties of independence and their application to Bayesian networks
• Tractable reasoning via approximation
• Dependence and independence
• Complexity results for modal dependence logic
• On the conditional independence implication problem: a lattice-theoretic approach
• On a problem of Fagin concerning multivalued dependencies in relational databases
• Reasoning about functional and full hierarchical dependencies over partial relations
• Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
• Characterising nested database dependencies by fragments of propositional logic
• On the undecidability of implications between embedded multivalued database dependencies
• Independence in Database Relations
• Propositional Reasoning about Saturated Conditional Probabilistic Independence
• Logics for Approximating Implication Problems of Saturated Conditional Independence
• Hierarchies in Dependence Logic
• Functional dependencies and constraints on null values in database relations
• Correction to “An equivalence between relational database dependencies and a fragment of propositional logic”
• On the menbership problem for functional and multivalued dependencies in relational databases
• An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
• An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
• On the Equivalence of Database Models
• An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
• Functional Dependencies in a Relational Database and Propositional Logic

This page was built for publication: Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data