Titlebook: Inductive Synthesis of Functional Programs; Universal Planning, Ute Schmid Book 2003 Springer-Verlag Berlin Heidelberg 2003 automatic prog

Carter

书目名称Inductive Synthesis of Functional Programs影响因子(影响力)




书目名称Inductive Synthesis of Functional Programs影响因子(影响力)学科排名




书目名称Inductive Synthesis of Functional Programs网络公开度




书目名称Inductive Synthesis of Functional Programs网络公开度学科排名




书目名称Inductive Synthesis of Functional Programs被引频次




书目名称Inductive Synthesis of Functional Programs被引频次学科排名




书目名称Inductive Synthesis of Functional Programs年度引用




书目名称Inductive Synthesis of Functional Programs年度引用学科排名




书目名称Inductive Synthesis of Functional Programs读者反馈




书目名称Inductive Synthesis of Functional Programs读者反馈学科排名

invulnerable

MAIZE

3. Constructing Complete Sets of Optimal Plans input examples into the desired output. Because our work is in the context of program synthesis, planning is for small, deterministic domains and completeness and optimality are of more concern than efficiency considerations.

expansive

colloquial

临时抱佛脚

6. Automatic Programmingtomatize as large a part of the development of computer programs as possible. A more modest goal is to automatize or support special aspects of program development - such as program verification or generation of high-level programs from specifications. The focus of this chapter is on program generat

吞没

7. Folding of Finite Program Termsaces. This problem is researched in inductive synthesis of functional programs - as second step of synthesis - and in programming by demonstration (see chap. 6). Traces can be provided to the system by the system user, they can be recorded from interactions of a user with a program, or they can be c

cluster

8. Transforming Plans into Finite Programs chapter, we introduce an approach to transform plans generated by universal planning into finite programs which are used as input to our folder. On the one hand, we present an alternative approach to realizing the first step of inductive program synthesis as described in section 6.3.4 in chapter 6

nutrition

9. Conclusions and Further Researchof objects, then transforming this plan into a finite program term, and folding this term into a recursive program scheme. While planning and folding can be performed by powerful, domain-independent algorithms, plan transformation is knowledge dependent. In part I, we presented the domain-independen

率直