Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article - MaRDI portal

scientific article

From MaRDI portal
Publication:4035210

zbMath0764.60004MaRDI QIDQ4035210

Milan Studený

Publication date: 18 May 1993


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Graphoid properties of epistemic irrelevance and independenceOn the finite and general implication problems of independence atoms and keysUnnamed ItemReduction of database independence to dividing in atomless Boolean algebrasConcise representations and construction algorithms for semi-graphoid independency modelsConditional independence and natural conditional functionsGeneralized rules of probabilistic independenceGaussoids are two-antecedental approximations of Gaussian conditional independence structuresCausal discovery and the problem of ignorance. An adaptive logic approachA computational algebraic-geometry method for conditional-independence inferenceAxioms of causal relevanceA note on marginal and conditional independenceNested Markov properties for acyclic directed mixed graphsThe geometry of Gaussian double Markovian distributionsAcyclic directed graphs representing independence modelsDESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts1DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 2nd part: basic theoryDESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 3rd part: examples of use and appendices1Generalized Permutohedra from Probabilistic Graphical ModelsTwo generalizations of the semi-graphoid rule of probabilistic independence and moreA lattice-based representation of independence relations for efficient closure computationSound approximate reasoning about saturated conditional probabilistic independence under controlled uncertaintyUnnamed ItemOn interchangeability of Nash equilibria in multi-player strategic gamesRanking functions and rankings on languagesOn the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statementsA logical approach to context-specific independenceLogical and algorithmic properties of stable conditional independenceOn a hypergraph probabilistic graphical modelIndependency relationships and learning algorithms for singly connected networksRacing algorithms for conditional independence inferenceApproximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete DataFrontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositionsA comparative study of possibilistic conditional independence and lack of interactionGaussian conditional independence relations have no finite complete characterizationA Logical Approach to Context-Specific IndependenceMarginals of DAG-Isomorphic Independence ModelsGame Semantics for the Geiger-Paz-Pearl Axioms of IndependenceContribution of Frantisek Matus to the research on conditional independenceThe implication problem for functional dependencies and variants of marginal distribution equivalences