...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Theory and Practice of Logic Programming >Speedup of logic programs by binarization and partial deduction
【24h】

Speedup of logic programs by binarization and partial deduction

机译：通过二值化和部分推导来加速逻辑程序

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

摘要

Binary logic programs can be obtained from ordinary logic programs by a binarizing transformation. In most cases, binary programs obtained this way are less efficient than the original programs. (Demoen, 1992) showed an interesting example of a logic program whose computational behaviour was improved when it was transformed to a binary program and then specialized by partial deduction. The class of B-stratifiable logic programs is defined. It is shown that for every B-stratifiable logic program, binarization and subsequent partial deduction produce a binary program which does not contain variables for continuations introduced by binarization. Such programs usually have a better computational behaviour than the original ones. Both binarization and partial deduction can be easily automated. A comparison with other related approaches to program transformation is given.
机译：二进制逻辑程序可以通过二进制转换从普通逻辑程序中获得。在大多数情况下，以这种方式获得的二进制程序的效率要低于原始程序。 （Demoen，1992）展示了一个有趣的逻辑程序示例，该程序在转换为二进制程序然后通过部分推导进行专门化后，其计算行为得到了改善。定义了B可分层逻辑程序的类别。结果表明，对于每个B可分层的逻辑程序，二进制化和随后的部分推导都会产生一个二进制程序，该程序不包含由二进制化引入的连续变量。这样的程序通常比原始程序具有更好的计算行为。二值化和部分推论都可以轻松实现自动化。与程序转换的其他相关方法进行了比较。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号