Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
From MaRDI portal
Publication:2446551
DOI10.1016/j.jal.2013.05.004zbMath1284.68551MaRDI QIDQ2446551
Publication date: 17 April 2014
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2013.05.004
complexity; algorithm; approximation; propositional logic; implication; missing data; conditional independence; axiomatization; discrete probability measure; \(\mathcal S\)-3 logic
68T37: Reasoning under uncertainty in the context of artificial intelligence
Related Items
Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data, A logical approach to context-specific independence, Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions, On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements, A Logical Approach to Context-Specific Independence
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
- Design by example: An application of Armstrong relations
- Independent natural extension
- The EM algorithm for graphical association models with missing data
- Corrigendum to ``On the undecidability of implications between embedded multivalued database dependencies
- An independence relation for sets of secrets
- Logical and algorithmic properties of stable conditional independence
- Charting the completeness frontier of inference systems for multivalued dependencies
- Database relations with null values
- A logical notion of conditional independence: properties and applications
- Inferences of multivalued dependencies in fixed and undetermined universes
- A unique formal system for binary decompositions of database relations, probability distributions, and graphs
- Axiomatisation of functional dependencies in incomplete relations
- Logical and algorithmic properties of conditional independence and graphical models
- Logical and algorithmic properties of independence and their application to Bayesian networks
- Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables
- Conditional independence in propositional logic.
- Tractable reasoning via approximation
- Independence in information spaces
- Dependence and independence
- On a problem of Fagin concerning multivalued dependencies in relational databases
- On the undecidability of implications between embedded multivalued database dependencies
- Propositional Reasoning about Saturated Conditional Probabilistic Independence
- Three-Valued Logics for Incomplete Information and Epistemic Logic
- ON THE IMPLICATION OF MULTIVALUED DEPENDENCIES IN PARTIAL DATABASE RELATIONS
- Modeling and Reasoning with Bayesian Networks
- On the Structure of Armstrong Relations for Functional Dependencies
- An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
- An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
- An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
- Horn clauses and database dependencies
- Foundations of Information and Knowledge Systems
