首页> 外文期刊>Fundamenta Informaticae >A Tractable Rule Language in the Modal and Description Logic that Combines CPDL with Regular Grammar Logic
【24h】

A Tractable Rule Language in the Modal and Description Logic that Combines CPDL with Regular Grammar Logic

机译:模态和描述逻辑中的可操作规则语言,结合了CPDL和常规语法逻辑

获取原文
获取原文并翻译 | 示例
           

摘要

Combining CPDL (Propositional Dynamic Logic with Converse) and regular grammar logic results in an expressive modal logic denoted by CPDLreg. This logic covers TEAMLOG, a logical formalism used to express properties of agents’ cooperation in terms of beliefs, goals and intentions. It can also be used as a description logic for expressing terminological knowledge, in which both regular role inclusion axioms and CPDL-like role constructors are allowed. In this paper, we develop an expressive and tractable rule language called Horn-CPDLreg. As a special property, this rule language allows the concept constructor “universal restriction” to appear on the left hand side of general concept inclusion axioms. We use a special semantics for Horn-CPDLreg that is based on pseudo-interpretations. It is called the constructive semantics and coincides with the traditional semantics when the concept constructor “universal restriction” is disallowed on the left hand side of concept inclusion axioms or when the language is used as an epistemic formalism and the accessibility relations are serial. We provide an algorithm with PTIME data complexity for checking whether a knowledge base in Horn-CPDLreg has a pseudo-model. This shows that the instance checking problem in Horn-CPDLreg with respect to the constructive semantics has PTIME data complexity.
机译:将CPDL(带有逆的命题动态逻辑)和常规语法逻辑相结合,可以得到以CPDLreg表示的表达模态逻辑。该逻辑涵盖TEAMLOG,TEAMLOG是一种逻辑形式主义,用于根据信念,目标和意图表达代理合作的属性。它也可以用作表达术语知识的描述逻辑,其中既允许常规角色包含公理也允许类似CPDL的角色构造函数。在本文中,我们开发了一种称为Horn-CPDLreg的可表达且易于处理的规则语言。作为一种特殊的属性,此规则语言允许概念构造器“通用约束”出现在常规概念包含公理的左侧。我们对Horn-CPDLreg使用基于伪解释的特殊语义。当概念包含公理的左侧不允许概念构造器“通用约束”,或者当语言被用作认知形式主义并且可访问性关系是串行的时,它被称为构造语义,并且与传统语义相吻合。我们提供了一种具有PTIME数据复杂度的算法,用于检查Horn-CPDLreg中的知识库是否具有伪模型。这表明在Horn-CPDLreg中关于构造语义的实例检查问题具有PTIME数据复杂性。

著录项

  • 来源
    《Fundamenta Informaticae》 |2016年第2期|113-139|共27页
  • 作者

    Nguyen Linh Anh;

  • 作者单位

    Division of Knowledge and System Engineering for ICT, Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh City, Vietnam.,Institute of Informatics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland.;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号