首页> 外文期刊>Journal of logic and computation >Embedding-based approaches to paraconsistent and temporal description logics
【24h】

Embedding-based approaches to paraconsistent and temporal description logics

机译:基于嵌入的超一致和时间描述逻辑方法

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

摘要

In this article, some paraconsistent and temporal description logics are studied based on an embedding-based proof method. A new paraconsistent description logic, VALL, is obtained from the description logic ALL by adding a paraconsistent negation. Two temporal description logics, XALL and BALL_l, are introduced by combining and modifying ALL and Prior's tomorrow tense logic. XALL has the next-time operator, and BALL_l has some restricted versions of the next-time, any-time and some-time operators, in which the time domain is bounded by a positive integer l. Some theorems for embedding VALL, XALL and BALL_l into ALL are proved in a uniform way, and VALL, XALL and BALLi are shown to be decidable. Three tableau calculi for VALL, XALL and BALL_l are introduced, and the completeness theorems for these calculi are proved.
机译:在本文中,基于基于嵌入的证明方法研究了一些超常和时态描述逻辑。通过添加超一致性否定,从超逻辑描述中获得了一个新的超一致性描述逻辑VALL。通过组合和修改ALL和Prior的明日式时态逻辑,引入了两个时间描述逻辑XALL和BALL_1。 XALL具有下一次运算符,而BALL_1具有某些下一次,任意时间和某些时间运算符的受限版本,其中时域以正整数l为界。以统一的方式证明了将VALL,XALL和BALL_1嵌入ALL的一些定理,并且表明VALL,XALL和BALLi是可判定的。介绍了针对VALL,XALL和BALL_1的三个表格计算,并证明了这些计算的完备性定理。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号