Conditional independence in propositional logic.

DOI10.1016/S0004-3702(02)00244-8zbMath1043.68094OpenAlexW2066789866MaRDI QIDQ1852858

Jérôme Lang, Pierre Marquis, Paolo Liberatore

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00244-8

zbMATH Keywords

NoveltySeparabilityRelevanceConditional independence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Related Items (7)

On propositional definability ⋮ Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty ⋮ On interchangeability of Nash equilibria in multi-player strategic games ⋮ Lost in translation: language independence in propositional logic -- application to belief change ⋮ On the Computational Complexity of Non-Dictatorial Aggregation ⋮ A logic-algebraic tool for reasoning with knowledge-based systems ⋮ Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A logical notion of conditional independence: properties and applications
• Relevance from an epistemic perspective
• The polynomial-time hierarchy
• The complexity of logic-based abduction
• Novelty in deductive databases
• Propositional information systems

This page was built for publication: Conditional independence in propositional logic.