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
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
Hypergraphs of multiparty secrets
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
A ternary knowledge relation on secrets
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Game semantics for the Geiger-Paz-pearl axioms of independence
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
Independence in Information Spaces
Studia Logica
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 a multi-argument independence relation between messages sent over the edges of a directed acyclic graph. This relation is a generalization of a relation known in information flow as nondeducibility. A logical system that describes the properties of this relation for an arbitrary fixed directed acyclic graph is introduced and proven to be complete and decidable