Independence in information spaces

DOI10.1007/S11225-012-9435-6MaRDI QIDQ1928485zbMATH OpenOpenAlexFDO

Authors 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

axiomatizationcompletenessindependenceinformation flow

Mathematics Subject Classification ID

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

Review text

The paper discusses dependencies in information spaces. An information space is any non-empty set the elements of which represent pieces of information, or ``secrets according to the terminology used in the paper. For example, an information space can be associated with a relational database, or with the information exchange of two or more intelligent agents. Understanding dependencies between secrets is thus important in several respects. Concerning databases, users are usually associated with specific privileges and are often allowed to query only specific tables. Concerning information exchange, agents might be interested in preserving sensitive secrets. In particular, the paper introduces a new type of interdependence satisfying the following properties: {\parindent=0.5cm\begin{itemize}\item[--] any set of secrets is independent from the empty set; \item[--] independence is a symmetric relation; \item[--] if two sets \(A,B\) of secretes are independent, then \(A\) is independent from any subset of \(B\); \item[--] public knowledge, i.e., attributes associated with constant functions, does not introduce dependencies. \end{itemize}} A complete and decidable axiomatization of this new independence relation is provided.

Recommendations

• An Independence Relation for Sets of Secrets
• An independence relation for sets of secrets
• The functional dependence relation on hypergraphs of secrets
• Hypergraphs of multiparty secrets
• Hypergraphs of multiparty secrets

Cites work

• An independence relation for sets of secrets
• 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
• Game Semantics for the Geiger-Paz-Pearl Axioms of Independence
• scientific article; zbMATH DE number 3464827 (Why is no real title available?)
• Hypergraphs of multiparty secrets
• Information flow on directed acyclic graphs
• Logic of secrets in collaboration networks

Cited in

(6)

• Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
• The functional dependence relation on hypergraphs of secrets
• Hypergraphs of multiparty secrets
• An Independence Relation for Sets of Secrets
• Knowing values and public inspection
• Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions

This page was built for publication: Independence in information spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928485)