Independence in information spaces

DOI10.1007/s11225-012-9435-6zbMath1268.03035OpenAlexW1991475893MaRDI QIDQ1928485

Pavel Naumov

Publication date: 3 January 2013

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-012-9435-6

zbMATH Keywords

independencecompletenessaxiomatizationinformation flow

Mathematics Subject Classification ID

Database theory (68P15) Logic in artificial intelligence (68T27) Logic in computer science (03B70) Agent technology and artificial intelligence (68T42)

Related Items (3)

Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty ⋮ Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions ⋮ Knowing Values and Public Inspection

Cites Work

• Unnamed Item
• Hypergraphs of multiparty secrets
• Logic of secrets in collaboration networks
• An independence relation for sets of secrets
• Axioms and algorithms for inferences involving probabilistic independence
• Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence
• Information Flow on Directed Acyclic Graphs
• Game Semantics for the Geiger-Paz-Pearl Axioms of Independence
• An Independence Relation for Sets of Secrets

This page was built for publication: Independence in information spaces