首页> 外文期刊>International Journal of Innovative Computing Information and Control >THEORETICAL BASIS FOR MAKING EQUIVALENT TRANSFORMATION RULES FROM LOGICAL EQUIVALENCES FOR PROGRAM SYNTHESIS
【24h】

THEORETICAL BASIS FOR MAKING EQUIVALENT TRANSFORMATION RULES FROM LOGICAL EQUIVALENCES FOR PROGRAM SYNTHESIS

机译:从程序合成的逻辑等式中得出等效变换规则的理论基础

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

摘要

To propose methods for making Equivalent Transformation (ET) rules is important for generating correct and sufficiently efficient programs from a specification which is a set of logical formulas. An ET rule is a procedure for replacing a clause set with another one while preserving declarative meaning. This paper proposes a new method for making ET rules via a Logical Equivalence (LE) from a specification. An LE describes an equivalence relationship between two logical formulas under some specified preconditions. We newly formulate an LE and define the correctness of LEs with respect to a specification. It is guaranteed by the method of this paper that an ET rule can be made from a correct LE. The method is useful for the generation of various programs. Many ET rules included in programs which solve constraint satisfaction problems, can be made by the method.
机译:提出用于制定等效变换(ET)规则的方法对于从规范(它是一组逻辑公式)中生成正确且足够有效的程序很重要。 ET规则是一种在保留声明性含义的同时用另一个子集替换子集的过程。本文提出了一种通过规范中的逻辑对等(LE)制定ET规则的新方法。 LE描述了在某些指定前提下两个逻辑公式之间的等价关系。我们重新制定了LE并根据规范定义了LE的正确性。通过本文的方法保证了可以根据正确的LE制定ET规则。该方法对于生成各种程序很有用。该方法可以制定解决约束满足问题的程序中包含的许多ET规则。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号