Dynamic Epistemic Logic of Resource Bounded Information Mining Agents
CoRR(2024)
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要