• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>World multiconference on systems, cybernetics and informatics >Program Synthesis from a Set of Definite Clauses and a Query
【24h】

Program Synthesis from a Set of Definite Clauses and a Query

机译：从一组明确的条款和查询的程序综合

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Given a set of definite clauses and a query, the program synthesis presented in this paper is to generate a correct and efficient program to answer the query. In logic programming, a set of definite clauses is regarded as a program, which is called a logic program. However, there are many logic programs that are not very efficient and some natural logic programs do not terminate and fail to find all solutions correctly. To overcome the difficulty, we use the "equivalent transformation (ET)" model, where computation is regarded as equivalent transformation of declarative descriptions (e.g., a set of definite clauses) by a number of equivalent transformation rules. Thus, generating ET rules that can transform a set of definite clauses equiv-alently is a foundation of the proposed method for program synthesis. A new concept of meta-descriptions, each of which represents infinite descriptions by instantiation, is introduced. Meta-descriptions are transformed equiva-lently by means of meta-rules to generate ET rules. An ET rule is obtained from each pair of meta-descriptions that are equivalent.
机译：鉴于一组明确的条款和查询，本文呈现的程序合成是生成正确和高效的程序来接听查询。在逻辑编程中，一组明确的子句被视为一个程序，称为逻辑程序。但是，有许多逻辑程序不是非常有效的，并且某些自然逻辑程序不会终止并且无法正确找到所有解决方案。为了克服困难，我们使用“等效变换（ET）”的模式，其中，计算被认为是由许多的等效转换规则声明描述的等价变换（例如，一组明确子句）。因此，生成ET规则，即可以平稳地改变一组明确的条款是所提出的程序合成方法的基础。介绍了Meta描述的新概念，其中每个描述由实例化表示无限描述。通过Meta-Rulial将Meta描述转换为生成ET规则。从一对等同的元描述中获得ET规则。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号