首页> 外文会议>International Symposium on Frontiers of Combining Systems >Computing Minimal Models Modulo Subset-Simulation for Modal Logics
【24h】

Computing Minimal Models Modulo Subset-Simulation for Modal Logics

机译:计算Modul逻辑模拟Modulo Subset-Simulation

获取原文

摘要

In this paper we propose a novel minimality criterion for models of modal logics based on a variation of the notion of simulation, called subset-simulation. We present a minimal model sound and complete tableau calculus for the generation of this new kind of minimal models for the multi-modal logic K_(m), and we discuss extensions to cover more expressive logics. The generation of minimal models is performed incrementally by using a minimality test to close branches representing non-minimal models, or to update the set of minimal models. Subset-simulation minimal models have the advantage that they are semantically more natural than models obtained by using syntactic minimality criteria.
机译:在本文中,我们提出了一种基于模拟概念的模型模型的新颖性最小标准,称为子集仿真。我们为多模态逻辑K_(M)产生了最小的模型声音和完整的Tableau Congulus,用于生成这种新的最小模型,我们讨论了延长以涵盖更快递的逻辑。通过使用最小的测试来逐步地执行最小模型以关闭代表非最小模型的分支,或者更新最小模型集。子集 - 仿真最小模型具有比使用句法最小标准获得的模型更自然的优点。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号