arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0001015cs.AIcs.LO
收藏

Multi-Agent Only Knowing

Multi-Agent Only Knowing

Joseph Y. Halpern, Gerhard Lakemeyer

摘要:

莱韦斯克引入了“只知道”的概念,目的是捕捉某些类型的非单调推理。莱韦斯克的逻辑只处理单个代理人的情况。最近,Halpern和Lakemeyer都独立地试图将Levesque的逻辑扩展到多智能体的情况。虽然它们的方法有一些相似之处,但也有一些重大的差异。在本文中,我们重新审视的概念,只有知道,回到第一原则。在这个过程中,我们简化了Levesque的完备性证明,并指出了早期定义中的一些问题。这使我们重新思考什么是只知道的属性。我们提供了一个公理系统,捕捉我们的desiderata,并表明它有一个语义,对应于it. The公理系统有一个额外的功能的兴趣:它包括一个模态算子的可满足性,从而提供了一个完整的公理化的可满足性的逻辑K45。

英文摘要:

Levesque introduced a notion of ``only knowing'', with the goal of capturing certain types of nonmonotonic reasoning. Levesque's logic dealt with only the case of a single agent. Recently, both Halpern and Lakemeyer independently attempted to extend Levesque's logic to the multi-agent case. Although there are a number of similarities in their approaches, there are some significant differences. In this paper, we reexamine the notion of only knowing, going back to first principles. In the process, we simplify Levesque's completeness proof, and point out some problems with the earlier definitions. This leads us to reconsider what the properties of only knowing ought to be. We provide an axiom system that captures our desiderata, and show that it has a semantics that corresponds to it. The axiom system has an added feature of interest: it includes a modal operator for satisfiability, and thus provides a complete axiomatization for satisfiability in the logic K45.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑