...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Theory and Practice of Logic Programming >Transformations of logic programs with goals as arguments
【24h】

Transformations of logic programs with goals as arguments

机译：以目标为参数的逻辑程序的转换

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

摘要

We consider a simple extension of logic programming where variables may range over goals and goals may be arguments of predicates. In this language we can write logic programs which use goals as data. We give practical evidence that, by exploiting this capability when transforming programs, we can improve program efficiency. We propose a set of program transformation rules which extend the familiar unfolding and folding rules and allow us to manipulate clauses with goals which occur as arguments of predicates. In order to prove the correctness of these transformation rules, we formally define the operational semantics of our extended logic programming language. This semantics is a simple variant of LD-resolution. When suitable conditions are satisfied this semantics agrees with LD-resolution and, thus, the programs written in our extended language can be run by ordinary Prolog systems. Our transformation rules are shown to preserve the operational semantics and termination.
机译：我们考虑对逻辑编程的简单扩展，其中变量可能会超出目标范围，而目标可能是谓词的参数。用这种语言，我们可以编写将目标用作数据的逻辑程序。我们提供了实践证据，通过在转换程序时利用此功能，可以提高程序效率。我们提出了一组程序转换规则，这些规则扩展了熟悉的展开规则和折叠规则，并允许我们操纵带有作为谓词参数出现的目标的子句。为了证明这些转换规则的正确性，我们正式定义了扩展逻辑编程语言的操作语义。此语义是LD分辨率的简单变体。当满足适当的条件时，该语义与LD解析一致，因此，以我们的扩展语言编写的程序可以由普通Prolog系统运行。我们的转换规则显示为保留操作语义和终止。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号