Epistemic Logic for Communication Chains

The paper considers epistemic properties of linear communication chains. It describes a sound and complete logical system that, in addition to the standard axioms of S5 in a multi-modal language, contains two non-trivial axioms that capture the linear structure of communication chains.Comment: 7 pages, Contributed talk at TARK 2013 (arXiv:1310.6382) http://www.tark.or

Hypergraphs of Multiparty Secrets

The article 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 properties of interdependencies are expressed through a multi-argument relation called independence, which is a generalization of a binary relation also known as nondeducibility. The main result is a complete and decidable logical system that describes interdependencies that may exist on a fixed hypergraph. Additionally, the axioms and inference rules in this system are shown to be independent in the standard logical sense

Lighthouse principle for diffusion in social networks

The article investigates an influence relation between two sets of agents in a social network. It proposes a logical system that captures propositional properties of this relation valid in all threshold models of social networks with the same structure. The logical system consists of Armstrong axioms for functional dependence and an additional Lighthouse axiom. The main results are soundness, completeness, and decidability theorems for this logical system

Information Flow under Budget Constraints

Although first proposed in the database theory as properties of functional dependencies between attributes, Armstrong\u27s axioms capture general principles of information flow by describing properties of dependencies between sets of pieces of information. This article generalizes Armstrong\u27s axioms to a setting in which there is a cost associated with information. The proposed logical system captures general principles of dependencies between pieces of information constrained by a given budget

A ternary knowledge relation on secrets

ABSTRACT The paper introduces and studies the ternary relation "secret a reveals at least as much information about secret c as secret b ." In spite of its seeming simplicity, this relation has many non-trivial properties. The main result is a complete infinite axiomatization of the propositional theory of this relation

Epistemic Logic for Communication Chains

ABSTRACT The paper considers epistemic properties of linear communication chains. It describes a sound and complete logical system that, in addition to the standard axioms of S5 in a multi-modal language, contains two non-trivial axioms that capture the linear structure of communication chains

Information Flow on Directed Acyclic Graphs

Abstract. 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

Complete 2020 Program

Program and schedule of events for the 31st Annual John Wesley Powell Student Research Conference