• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>11th International Conference on Conceptual Structures, ICCS 2003 Jul 21-25, 2003 Dresden, Germany >Concept Graphs without Negations: Standard Models and Standard Graphs
【24h】

Concept Graphs without Negations: Standard Models and Standard Graphs

机译：不含否定的概念图：标准模型和标准图

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this article, we provide different possibilities for doing reasoning on simple concept(ual) graphs without negations or nestings. First of all, we have on the graphs the usual semantical entailment relation |=, and we consider the restriction |― of the calculus for concept graph with cuts, which has been introduced in [Da02], to the system of concept graphs without cuts. Secondly, we introduce a semantical entailment relation|= as well as syntactical transformation rules |― between models. Finally, we provide definitions for standard graphs and standard models so that we translate graphs to models and vice versa. Together with the relations |= and |― on the graphs and on the models, we show that both calculi are adequate and that reasoning can be carried over from graphs to models and vice versa.
机译：在本文中，我们提供了在没有负数或嵌套的情况下对简单概念图进行推理的不同可能性。首先，我们在图上具有通常的语义包含关系| =，并考虑了在[Da02]中引入的带割的概念图演算的限制| ―对没有割的概念图系统。其次，我们介绍了模型之间的语义蕴涵关系| =以及句法转换规则| ―。最后，我们提供标准图和标准模型的定义，以便将图转换为模型，反之亦然。连同图形和模型上的| =和| ―的关系，我们表明两种计算都足够，并且推理可以从图形转移到模型，反之亦然。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号