首页> 外文会议>International Workshop on Computer Algebra in Scientific Computing(CASC 2006); 20060911-15; Chisinau(MD) >Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView
【24h】

Solving Algorithmic Problems on Orders and Lattices by Relation Algebra and RelView

机译:用关系代数和RelView解决有序和格的算法问题

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

摘要

Relation algebra is well suited for dealing with many problems on ordered sets. Introducing lattices via order relations, this suggests to apply it and tools for its mechanization for lattice-theoretical problems, too. We combine relation algebra and the specific purpose Computer Algebra system RelView to solve some algorithmic problems.
机译:关系代数非常适合处理有序集上的许多问题。通过顺序关系介绍晶格,这建议将其及其机械化工具应用于晶格理论问题。我们将关系代数和专用于计算机的代数系统RelView相结合,以解决一些算法问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号