abnegate
发表于 2025-3-25 14:11:06
http://reply.papertrans.cn/59/5879/587883/587883_23.png
生来
发表于 2025-3-25 15:53:38
Synthesis and Transformation of Logic Programs from Constructive, Inductive Proof,used to show that the specification of a program is realisable; elaboration of a proof gives rise to the synthesis of a program which realises it. We present an update on earlier ideas, and give examples of and justification for them. The work is presented as foundation for further work in ., where
Ingredient
发表于 2025-3-25 22:03:08
http://reply.papertrans.cn/59/5879/587883/587883_25.png
intrigue
发表于 2025-3-26 02:59:49
Inductive Synthesis of Rewrite Rules as Program Synthesis, We are not concerned with explicitly known incompleteness during an unfinished design process. Instead, the present approach is focussed on specifications which are either a little incomplete by mistake or intentionally incomplete as descriptions by examples are. Completing given specifications to
好忠告人
发表于 2025-3-26 05:36:23
http://reply.papertrans.cn/59/5879/587883/587883_27.png
Polydipsia
发表于 2025-3-26 09:58:16
Towards Synthesis of Nearly Pure Prolog Programs, (either positive or negative), and metaknowledge about procedures are used as input. A refinement operator then uses breadth first search beginning with the most general clause. IDS can also build new clauses by inductive inference. The following operators for generalization/specialization are used
receptors
发表于 2025-3-26 16:40:35
http://reply.papertrans.cn/59/5879/587883/587883_29.png
Amorous
发表于 2025-3-26 19:21:25
http://reply.papertrans.cn/59/5879/587883/587883_30.png
ostracize
发表于 2025-3-27 00:54:36
An Automatic Transformation Strategy for Avoiding Unnecessary Variables in Logic Programs,ing the meaning of programs. Often one also uses variables which are ., in the sense that they are not required for describing the input-output relation. Unnecessary variables are used by the programmer because they often allow for a more transparent way of writing programs or an easier proof of the
PANG
发表于 2025-3-27 03:42:14
On Using Mode Input-output for Transforming Logic Programs,irst we introduce a notion of well-moded clause and well-moded definite program. We prove that under certain conditions the application of the Unfold/Fold transformations preserves the notion of well-modedness. We also define a transformation of a definite program into term rewriting system and we e