首页> 外文会议>7th International Conference on Conceptual Structures, ICCS'99, Jul 12-15, 1999, Blacksburg, VA, USA >Algorithms for Creating Relational Power Context Families from Conceptual Graphs
【24h】

Algorithms for Creating Relational Power Context Families from Conceptual Graphs

机译:从概念图创建关系能力上下文族的算法

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

摘要

This paper reports on the implementation of Wille's algorithm for creating power context families from conceptual graphs. It describes how to extend FCA tools, such as TOSCANA, to accommodate the expressibility of CG's. It further reports on a tool where Wille's Algorithm, along with an algorithm to create SQL queries from power context families, has been implemented and applied. These algorithms are given a detailed presentation in this paper and their complexity provided.
机译:本文报告了从概念图创建幂上下文族的Wille算法的实现。它描述了如何扩展FCA工具(例如TOSCANA)以适应CG的可表达性。它进一步报告了一个工具,其中已实现并应用了Wille算法以及从电源上下文系列创建SQL查询的算法。本文对这些算法进行了详细介绍,并提供了它们的复杂性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号