自治代理和多代理系统AAMAS(Autonomous Agents and Multi-Agent Systems)是国际自治代理和多代理系统基金会的官方杂志。它提供了一个领先的论坛,用于在自治代理和多代理系统的基础,理论,开发,分析和应用中传播重要的原始研究结果。 官网地址:http://dblp.uni-trier.de/db/journals/aamas/

VIP内容

题目: Epistemic Reasoning In Multiagent Systems

报告简介: 本教程介绍了动态认知逻辑,该逻辑使人们能够及时推理知识及其演化。 我们将首先展示如何为认知情况建模。 其次,我们将讨论推理任务的算法问题。 第三,我们将介绍动态逻辑的扩展。

嘉宾介绍:

Tristan Charrier,博士。 研究领域:符号模型,认知计划,用于指定认知情况的语言,认知推理的证明。

François Schwarzentruber是法国雷恩(ENS Rennes)副教授。 他目前的研究兴趣主要集中在逻辑理论及其在人工智能,代理和多代理系统以及计算机科学中的应用。 他曾是Synthese,Studia Logica和Theoretical Computer Science等期刊的审稿人。 自2011年以来,他的研究主要致力于研究动态认知逻辑。

slide简介:

  • 介绍
  • 知识与seeing
  • 知识与时间
  • 动态认知逻辑
  • 基于知识的项目
  • 总结
成为VIP会员查看完整内容
0
9

最新论文

We investigate the following many-to-one stable matching problem with diversity constraints (SMTI-Diverse): Given a set of students and a set of colleges which have preferences over each other, where the students have overlapping types, and the colleges each have a total capacity as well as quotas for individual types (the diversity constraints), is there a matching satisfying all diversity constraints such that no unmatched student-college pair has an incentive to deviate? SMTI-Diverse is known to be NP-hard. However, as opposed to the NP-membership claims in the literature [Aziz et al., AAMAS 2019; Huang, SODA 2010], we prove that it is beyond NP: it is complete for the complexity class $\Sigma^{\text{P}}_2$. In addition, we provide a comprehensive analysis of the problem's complexity from the viewpoint of natural restrictions to inputs and obtain new algorithms for the problem.

0
0
下载
预览
Top