A logical notion of conditional independence: properties and applications

DOI10.1016/S0004-3702(97)00042-8zbMath0903.68055MaRDI QIDQ1127351

Adnan Darwiche

Publication date: 13 August 1998

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

relevanceindependenceprobabilitylogiccausal networksgraphoidspruning knowledge basesstructure-based reasoning

Mathematics Subject Classification ID

Database theory (68P15) Logic in artificial intelligence (68T27)

Related Items (13)

Probabilistic logic with independence ⋮ A THEORETICAL FRAMEWORK FOR POSSIBILISTIC INDEPENDENCE IN A WEAKLY ORDERED SETTING ⋮ Speeding up inferences using relevance reasoning: a formalism and algorithms ⋮ Relevance from an epistemic perspective ⋮ Unnamed Item ⋮ Towards Agent-Oriented Relevant Information ⋮ Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty ⋮ Study of the diagnosability of automated production systems based on functional graphs ⋮ On strongest necessary and weakest sufficient conditions ⋮ Issues of feasibility, coherence, and robustness in a premise-to-claim model of argumentation: Result from four experiments ⋮ On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision ⋮ Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions ⋮ Conditional independence in propositional logic.

Cites Work

• Fusion and propagation with multiple observations in belief networks
• Characterizing diagnoses and systems
• Efficient inference in Bayes networks as a combinatorial optimization problem
• Structure-driven algorithms for truth maintenance
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A logical notion of conditional independence: properties and applications