An independence relation for sets of secrets

DOI10.1007/s11225-010-9223-0zbMath1197.03015OpenAlexW1970861284MaRDI QIDQ965899

Pavel Naumov, Sara Miner More

Publication date: 26 April 2010

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

Full work available at URL: https://doi.org/10.1007/s11225-010-9223-0

zbMATH Keywords

formal systeminformation flownondeducibility

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42)

Related Items (7)

Independence in information spaces ⋮ Symmetry in information flow ⋮ Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty ⋮ Hypergraphs of multiparty secrets ⋮ On interchangeability of Nash equilibria in multi-player strategic games ⋮ Knowing Values and Public Inspection ⋮ Game Semantics for the Geiger-Paz-Pearl Axioms of Independence

Cites Work

• A logic for information flow analysis with an application to forward slicing of simple imperative programs
• Axioms and algorithms for inferences involving probabilistic independence
• An Independence Relation for Sets of Secrets
• Unnamed Item

This page was built for publication: An independence relation for sets of secrets