首页> 外文期刊>Journal of software >Deciding the SHOQ(D)-Satisfiability with a Fully Tiered Clause Group
【24h】

Deciding the SHOQ(D)-Satisfiability with a Fully Tiered Clause Group

机译:通过完全分层的条款组确定SHOQ(D)的满意度

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

摘要

SHOQ(D) is one of the fundamental theories In Description Logics due to its support to concrete datatypes and named individuals. At present, deciding the satisfiability of SHOQ(D)-concepts is mainly completed by enhancing Tableau algorithm with blocking. However, there is still much to be desired in performance as there are tremendous description overlaps in completion forest, thus causing great spatial waste as a result. To tackle this problem, this paper presented a new approach to check the satisfiability of acyclic SHOQ(D)-concepts-FTC(Fully Tiered Clauses) algorithm. This calculus can make a direct judgement on the satisfiability of acyclic SHOQ(D)-concept by translating its description into a fully tiered clause group whose satisfiability is directly available, and reusing clauses to block unnecessary extensions. FTC algorithm eliminates description overlaps to the largest extent as it works on concept description directly. Therefore, FTC algorithm has notably better performance than Tableau by saving a lot of spatial costs.
机译:SHOQ(D)由于支持具体的数据类型和命名的个人,因此是描述逻辑中的基本理论之一。目前,确定SHOQ(D)概念的可满足性主要是通过增强具有阻止功能的Tableau算法来完成的。但是,由于在完整森林中存在大量的描述重叠,因此在性能方面仍然有很多需求,因此导致大量的空间浪费。针对这一问题,本文提出了一种新的方法来检验非循环SHOQ(D)-概念-FTC(完全分层子句)算法的可满足性。该演算可以通过将非循环SHOQ(D)概念的描述转换为可直接获得其满意度的完全分层的子句组,并重新使用子句以阻止不必要的扩展,从而直接判断非循环SHOQ(D)概念的可满足性。 FTC算法在直接进行概念描述时就最大程度地消除了描述重叠。因此,通过节省大量空间成本,FTC算法的性能明显优于Tableau。

著录项

  • 来源
    《Journal of software》 |2012年第2期|p.322-331|共10页
  • 作者

    Huamao Gu; Jinqin Shi; Xun Wang;

  • 作者单位

    Zhejiang Gongshang University/Institute of Artificial Intelligence, Hangzhou, China;

    Zhejiang Gongshang University/Institute of Artificial Intelligence, Hangzhou, China;

    Zhejiang Gongshang University/Institute of Artificial Intelligence, Hangzhou, China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    satisfiability; concept clause; SHOQ(D); fully tiered clauses;

    机译:可满足性概念条款SHOQ(D);完全分层的条款;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号