首页> 外文会议>Formal Concept Analysis >Acquiring Generalized Domain-Range Restrictions
【24h】

Acquiring Generalized Domain-Range Restrictions

机译:获取广义域范围限制

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

摘要

Proposing a certain notion of logical completeness as a novel quality criterion for ontologies, we identify and characterise a class of logical propositions which naturally extend domain and range restrictions commonly known from diverse ontology modelling approaches. We argue for the intuitivity of this kind of axioms and show that they fit equally well into formalisms based on rules as well as ones based on description logics. Extending the attribute exploration technique from formal concept analysis (FCA), we present an algorithm for the efficient interactive specification of all axioms of this form valid in a domain of interest. We compile some results that apply when role hierarchies and symmetric roles come into play and demonstrate the presented method in a small example.
机译:提出某种逻辑完整性的概念作为本体的一种新颖的质量标准,我们确定并描述了一类逻辑命题,这些命题自然地扩展了领域和范围限制,而这些限制通常是各种本体建模方法中众所周知的。我们对这种公理的直觉性进行了论证,并表明它们同样适用于基于规则的形式主义和基于描述逻辑的形式主义。从形式概念分析(FCA)扩展了属性探索技术,我们提出了一种算法,用于有效交互规范该形式的所有公理,该公理在感兴趣的域中有效。我们汇总了一些适用于角色层次结构和对称角色的结果,并在一个小示例中演示了所提出的方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号