Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
From MaRDI portal
Publication:744991
DOI10.1016/J.TCS.2015.07.017zbMATH Open1330.68279OpenAlexW1119958565MaRDI QIDQ744991FDOQ744991
Authors: Sebastian Link 
Publication date: 12 October 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.017
Recommendations
- Propositional reasoning about saturated conditional probabilistic independence
- Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data
- A finite axiomatization of conditional independence and inclusion dependencies
- A finite axiomatization of conditional independence and inclusion dependencies
- Conditional independence in propositional logic.
complexityconditional independenceaxiomatizationimplicationpropositional logicdiscrete probability measurehierarchical database decomposition
Reasoning under uncertainty in the context of artificial intelligence (68T37) Database theory (68P15) Logic in artificial intelligence (68T27)
Cites Work
- Axioms and algorithms for inferences involving probabilistic independence
- Dependence and independence
- On the conditional independence implication problem: a lattice-theoretic approach
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- On the undecidability of implications between embedded multivalued database dependencies
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Title not available (Why is that?)
- Logical and algorithmic properties of conditional independence and graphical models
- A mathematical introduction to logic.
- An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
- Charting the completeness frontier of inference systems for multivalued dependencies
- Semantic foundations of 4NF in relational database design
- Tractable reasoning via approximation
- Independence in database relations
- An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
- Title not available (Why is that?)
- Characterisations of multivalued dependency implication over undetermined universes
- Corrigendum to ``On the undecidability of implications between embedded multivalued database dependencies
- Logical and algorithmic properties of stable conditional independence
- Functional Dependencies in a Relational Database and Propositional Logic
- A logical notion of conditional independence: properties and applications
- Propositional reasoning about saturated conditional probabilistic independence
- Hierarchies in Dependence Logic
- On the menbership problem for functional and multivalued dependencies in relational databases
- Axiomatisation of functional dependencies in incomplete relations
- Characterising nested database dependencies by fragments of propositional logic
- On the Equivalence of Database Models
- Appropriate inferences of data dependencies in relational databases
- Functional dependencies and constraints on null values in database relations
- An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
- Conditional independence in propositional logic.
- Concurrency semantics for the Geiger-Paz-Pearl axioms of independence
- On interchangeability of Nash equilibria in multi-player strategic games
- Logical and algorithmic properties of independence and their application to Bayesian networks
- Independence in information spaces
- On inferences of full first-order hierarchical decompositions
- Correction to “An equivalence between relational database dependencies and a fragment of propositional logic”
Cited In (10)
- Propositional reasoning about saturated conditional probabilistic independence
- On the finite and general implication problems of independence atoms and keys
- Logics for approximating implication problems of saturated conditional independence
- On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
- Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- Partition Dependencies in Hierarchies of Probabilistic Decision Tables
- A logical approach to context-specific independence
- A Logical Approach to Context-Specific Independence
- A computational algebraic-geometry method for conditional-independence inference
This page was built for publication: Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744991)
