发帖
雷达卡
摘要翻译：
本文提出{em精化模态逻辑}。一个精化就像一个双模拟，除了从三个关系需求中只需要满足“原子”和“返回”。我们的逻辑包含一个新的运算符'all'，除了标准的模式'box'为每个代理。运算符“all”在给定模型的所有精化集上充当量词。作为一个双模拟量词的变体，这个精化运算符或精化量词“all”可以被看作是对一个变量进行量化，这个变量不存在于由它约束的公式中。该逻辑结合了多智能体模态逻辑的简单性和一元二阶量化的一些幂。我们提出了一个完善的多智能体求精模态逻辑公理化。我们还给出了模态Mu-演算的一个推广，并给出了该逻辑的单主体版本的公理化。还讨论了实例和应用：软件验证和设计（代理集也可以看作是一组动作），以及动态认知逻辑。我们进一步对可满足性的复杂性和简洁性给出了详细的结果。
---
英文标题：
《Refinement Modal Logic》
---
作者：
Laura Bozzelli, Hans van Ditmarsch, Tim French, James Hales, and
Sophie Pinchinat
---
最新提交年份：
2013
---
分类信息：
一级分类：Computer Science 计算机科学
二级分类：Logic in Computer Science 计算机科学中的逻辑
分类描述：Covers all aspects of logic in computer science, including finite model theory, logics of programs, modal logic, and program verification. Programming language semantics should have Programming Languages as the primary subject area. Roughly includes material in ACM Subject Classes D.2.4, F.3.1, F.4.0, F.4.1, and F.4.2; some material in F.4.3 (formal languages) may also be appropriate here, although Computational Complexity is typically the more appropriate subject area.
涵盖计算机科学中逻辑的所有方面，包括有限模型理论，程序逻辑，模态逻辑和程序验证。程序设计语言语义学应该把程序设计语言作为主要的学科领域。大致包括ACM学科类D.2.4、F.3.1、F.4.0、F.4.1和F.4.2中的材料；F.4.3（形式语言）中的一些材料在这里也可能是合适的，尽管计算复杂性通常是更合适的主题领域。
--
一级分类：Computer Science 计算机科学
二级分类：Artificial Intelligence 人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--
---
英文摘要：
In this paper we present {\em refinement modal logic}. A refinement is like a bisimulation, except that from the three relational requirements only `atoms' and `back' need to be satisfied. Our logic contains a new operator 'all' in addition to the standard modalities 'box' for each agent. The operator 'all' acts as a quantifier over the set of all refinements of a given model. As a variation on a bisimulation quantifier, this refinement operator or refinement quantifier 'all' can be seen as quantifying over a variable not occurring in the formula bound by it. The logic combines the simplicity of multi-agent modal logic with some powers of monadic second-order quantification. We present a sound and complete axiomatization of multi-agent refinement modal logic. We also present an extension of the logic to the modal mu-calculus, and an axiomatization for the single-agent version of this logic. Examples and applications are also discussed: to software verification and design (the set of agents can also be seen as a set of actions), and to dynamic epistemic logic. We further give detailed results on the complexity of satisfiability, and on succinctness.
---
PDF链接：
https://arxiv.org/pdf/1202.3538
京公网安备 11010802022788号
