Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
DOI10.1016/j.tcs.2015.07.017zbMath1330.68279OpenAlexW1119958565MaRDI QIDQ744991
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
complexitypropositional logicimplicationconditional independenceaxiomatizationdiscrete probability measurehierarchical database decomposition
Database theory (68P15) Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (3)
Cites Work
- 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
- On interchangeability of Nash equilibria in multi-player strategic games
- 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
- A logical notion of conditional independence: properties and applications
- Axioms and algorithms for inferences involving probabilistic independence
- Axiomatisation of functional dependencies in incomplete relations
- 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
- Conditional independence in propositional logic.
- Tractable reasoning via approximation
- Independence in information spaces
- Dependence and independence
- On the conditional independence implication problem: a lattice-theoretic approach
- 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
- Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence
- Hierarchies in Dependence Logic
- On Inferences of Full First-Order Hierarchical Decompositions
- 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: Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
