Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty (Q2446551): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jal.2013.05.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987308357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Armstrong Relations for Functional Dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferences of multivalued dependencies in fixed and undetermined universes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Appropriate inferences of data dependencies in relational databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-Valued Logics for Incomplete Information and Epistemic Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical notion of conditional independence: properties and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Reasoning with Bayesian Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent natural extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn clauses and database dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical and algorithmic properties of independence and their application to Bayesian networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical and algorithmic properties of conditional independence and graphical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependence and independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Fagin concerning multivalued dependencies in relational databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Information and Knowledge Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the undecidability of implications between embedded multivalued database dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to ``On the undecidability of implications between embedded multivalued database dependencies'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional independence in propositional logic. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The EM algorithm for graphical association models with missing data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatisation of functional dependencies in incomplete relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3198885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Charting the completeness frontier of inference systems for multivalued dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE IMPLICATION OF MULTIVALUED DEPENDENCIES IN PARTIAL DATABASE RELATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisations of multivalued dependency implication over undetermined universes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional Reasoning about Saturated Conditional Probabilistic Independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unique formal system for binary decompositions of database relations, probability distributions, and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design by example: An application of Armstrong relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An independence relation for sets of secrets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence in information spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical and algorithmic properties of stable conditional independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable reasoning via approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4663408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database relations with null values / rank
 
Normal rank

Latest revision as of 10:51, 8 July 2024

scientific article
Language Label Description Also known as
English
Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
scientific article

    Statements

    Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty (English)
    0 references
    0 references
    17 April 2014
    0 references
    0 references
    algorithm
    0 references
    approximation
    0 references
    axiomatization
    0 references
    complexity
    0 references
    conditional independence
    0 references
    discrete probability measure
    0 references
    implication
    0 references
    missing data
    0 references
    \(\mathcal S\)-3 logic
    0 references
    propositional logic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references