Armstrong\u27s Axioms and Navigation Strategies

The paper investigates navigability with imperfect information. It shows that the properties of navigability with perfect recall are exactly those captured by Armstrong\u27s axioms from database theory. If the assumption of perfect recall is omitted, then Armstrong\u27s transitivity axiom is not valid, but it can be replaced by a weaker principle. The main technical results are soundness and completeness theorems for the logical systems describing properties of navigability with and without perfect recall

Strategic knowledge acquisition

The article proposes a trimodal logical system that can express the strategic ability of coalitions to learn from their experience. The main technical result is the completeness of the proposed system

Navigability with Intermediate Constraints

The article studies navigability of an autonomous agent in a maze where some rooms may be indistinguishable. In a previous work the au- thors have shown that the properties of navigability in such a setting depend on whether an agent has perfect recall. Navigability by strategies with perfect recall is a transitive relation and navigability by memoryless strategies is not. Independently, Li and Wang proposed a notion of navigability with intermediate constraints for linear navigation strategies. Linear strategies are different from both perfect recall and memoryless strategies. This article shows that a certain form of transitivity, expressible in the language with intermediate constraints, holds for memoryless strate- gies. The main technical result is a sound and complete logical system describing the properties of memoryless strategies in the language with intermediate constraints

On composition of bounded-recall plans

The article studies the ability of agents with bounded memory to execute consecutive composition of plans. It gives an upper limit on the amount of memory required to execute the composed plans and shows that the limit cannot be improved. Furthermore, the article shows that there are, essentially, no other universal properties of plans for bounded-recall agents expressible through the relation "there is a plan for an agent with a given memory size to navigate from one given set of states to another"

Navigability with Bounded Recall

The paper studies navigability by machines with bounded recall in mazes with imperfect information. The main result is a sound and complete logical system for the relation “there is a machine with at most n states that can navigate from a setof classes of indistinguishable rooms X to a set of classes of indistinguishable rooms Y ”. The axioms of the system generalize Armstrong’s axioms of functional dependency from database theory

A dynamic logic of data-informed knowledge

With agents relying more and more on information from central servers rather than their own sensors, knowledge becomes property not of a specific agent but of the data that the agents can access. The article proposes a dynamic logic of data-informed knowledge that describes an interplay between three modalities and one relation capturing the properties of this form of knowledge. The main technical results are the undefinability of two dynamic operators through each other, a sound and complete axiomatisation, and a model checking algorithm.<br/