Axioms and algorithms for inferences involving probabilistic independence
Information and Computation
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
ACM Transactions on Information and System Security (TISSEC)
Database Systems: The Complete Book
Database Systems: The Complete Book
On interdependence of secrets in collaboration networks
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
An Independence Relation for Sets of Secrets
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
A ternary knowledge relation on secrets
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Information flow on directed acyclic graphs
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
The functional dependence relation on hypergraphs of secrets
CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems
Game semantics for the Geiger-Paz-pearl axioms of independence
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
Fault tolerance in belief formation networks
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
| Hi-index | 0.00 |
The paper considers interdependencies between secrets in a multiparty system. Each secret is assumed to be known only to a certain fixed set of parties. These sets can be viewed as edges of a hypergraph whose vertices are the parties of the system. The main result is a complete and decidable logical system that describes interdependencies that may exist on a fixed hypergraph. The properties of interdependencies are defined through a multi-argument relation called independence, which is a generalization of a binary relation also known as non deducibility.