Dynamic Epistemic Logic of Resource Bounded Information Mining Agents

TL;DR

This paper introduces a dynamic epistemic logic framework for resource-bounded agents that can purchase information through semi-public queries, considering costs and group resource sharing, with proven completeness and decidability.

Contribution

It proposes a novel logic for perfect reasoners to acquire information via semi-public queries, incorporating resource constraints and group sharing, with formal completeness and efficient model checking.

Findings

Logic is complete and decidable.

Model checking procedure is efficient.

Framework supports group resource sharing.

Abstract

Logics for resource-bounded agents have been getting more and more attention in recent years since they provide us with more realistic tools for modelling and reasoning about multi-agent systems. While many existing approaches are based on the idea of agents as imperfect reasoners, who must spend their resources to perform logical inference, this is not the only way to introduce resource constraints into logical settings. In this paper we study agents as perfect reasoners, who may purchase a new piece of information from a trustworthy source. For this purpose we propose dynamic epistemic logic for semi-public queries for resource-bounded agents. In this logic (groups of) agents can perform a query (ask a question) about whether some formula is true and receive a correct answer. These queries are called semi-public, because the very fact of the query is public, while the answer is private. We also assume that every query has a cost and every agent has a budget constraint. Finally, our framework allows us to reason about group queries, in which agents may share resources to obtain a new piece of information together. We demonstrate that our logic is complete, decidable and has an efficient model checking procedure.