检索结果-内蒙古大学图书馆

COMMUNICATIONS OF THE ACM 1971年第3期14卷 151-+页

作者： MANNA, Z WALDINGER, RJ Stanford Univ. CA Stanford Research Institute Menlo Park CA

An elementary outline of the theorem-proving approach to automatic program synthesis Is given, without dwelling on technical details. The method Is Illustrated by the automatic construction of both recursive and Iterative programs operating on natural numbers, lists, ant frees. In order to construct a program satisfying certain specifications, a theorem induced by those specifications is proved, and the desired program Is extracted from the proof. The same technique is applied to transform recursively defined functions into iterative programs, frequently with a major gain in efficiency. It is emphasized that hi order to construct a program with loops or with recursion, the principle of mathematical Induction must be applied. The relation between the version of the induction rule used and the form of the program constructed is explored in some detail. [ABSTRACT FROM AUTHOR]

关键词： answer extraction artificial intelligence automatic program synthesis mathematical induction principle problem solving theorem proving

来源：评论

学校读者我要写书评

暂无评论

Applying genetic programming to PSB2: the next generation program synthesis benchmark suite

引用

GENETIC programMING AND EVOLVABLE MACHINES 2022年第3期23卷 375-404页

作者： Helmuth, Thomas Kelly, Peter Hamilton Coll Comp Sci Clinton NY 13323 USA

For the past seven years, researchers in genetic programming and other program synthesis disciplines have used the General program synthesis Benchmark Suite (PSB1) to benchmark many aspects of systems that conduct programming by example, where the specifications of the desired program are given as input/output pairs. PSB1 has been used to make notable progress toward the goal of general program synthesis: automatically creating the types of software that human programmers code. Many of the systems that have attempted the problems in PSB1 have used it to demonstrate performance improvements granted through new techniques. Over time, the suite has gradually become outdated, hindering the accurate measurement of further improvements. The field needs a new set of more difficult benchmark problems to move beyond what was previously possible and ensure that systems do not overfit to one benchmark suite. In this paper, we describe the 25 new general program synthesis benchmark problems that make up PSB2, a new benchmark suite. These problems are curated from a variety of sources, including programming katas and college courses. We selected these problems to be more difficult than those in the original suite, and give results using PushGP showing this increase in difficulty. We additionally give an example of benchmarking using a state-of-the-art parent selection method, showing improved performance on PSB2 while still leaving plenty of room for improvement. These new problems will help guide program synthesis research for years to come.

关键词： automatic program synthesis Benchmarking Genetic programming

来源：评论

学校读者我要写书评

暂无评论

PSB2: The Second program synthesis Benchmark Suite

PSB2: The Second Program Synthesis Benchmark Suite

引用

2nd Genetic and Evolutionary Computation Conference (GECCO)

作者： Helmuth, Thomas Kelly, Peter Hamilton Coll Clinton NY 13323 USA

ISBN: (纸本)9781450383509

For the past six years, researchers in genetic programming and other program synthesis disciplines have used the General program synthesis Benchmark Suite to benchmark many aspects of automatic program synthesis systems. These problems have been used to make notable progress toward the goal of general program synthesis: automatically creating the types of software that human programmers code. Many of the systems that have attempted the problems in the original benchmark suite have used it to demonstrate performance improvements granted through new techniques. Over time, the suite has gradually become outdated, hindering the accurate measurement of further improvements. The field needs a new set of more difficult benchmark problems to move beyond what was previously possible. In this paper, we describe the 25 new general program synthesis benchmark problems that make up PSB2, a new benchmark suite. These problems are curated from a variety of sources, including programming katas and college courses. We selected these problems to be more difficult than those in the original suite, and give results using PushGP showing this increase in difficulty. These new problems give plenty of room for improvement, pointing the way for the next six or more years of general program synthesis research.

关键词： automatic program synthesis benchmarking genetic programming

来源：评论

学校读者我要写书评

暂无评论

What's AI done for me lately? Genetic programming's human-competitive results

引用

IEEE INTELLIGENT SYSTEMS 2003年第3期18卷 25-31页

作者： Koza, JR Keane, MA Streeter, MJ Stanford Univ Dept Med Biomed Informat Program Stanford CA 94305 USA Econometr Inc Chicago IL USA

The automated problem-solving technique of genetic programming has generated at least 36 human-competitive results. In six cases, it automatically duplicated the functionality of inventions patented after January 2000.

关键词： Genetic programming automatic program synthesis Human Competitive Results automatic Circuit synthesis Patents automatic programming

来源：评论

学校读者我要写书评

暂无评论

Tag-based regulation of modules in genetic programming improves context-dependent problem solving

引用

GENETIC programMING AND EVOLVABLE MACHINES 2021年第3期22卷 325-355页

作者： Lalejini, Alexander Moreno, Matthew Andres Ofria, Charles Michigan State Univ BEACON Ctr Study Evolut Act E Lansing MI 48824 USA Michigan State Univ Dept Comp Sci & Engn E Lansing MI 48824 USA Michigan State Univ Ecol Evolut & Behav Program E Lansing MI 48824 USA

We introduce and experimentally demonstrate the utility of tag-based genetic regulation, a new genetic programming (GP) technique that allows programs to dynamically adjust which code modules to *** are evolvable labels that provide a flexible mechanism for referencing code modules. Tag-based genetic regulation extends existing tag-based naming schemes to allow programs to "promote" and "repress" code modules in order to alter expression patterns. This extension allows evolution to structure a program as a gene regulatory network where modules are regulated based on instruction executions. We demonstrate the functionality of tag-based regulation on a range of program synthesis problems. We find that tag-based regulation improves problem-solving performance on context-dependent problems;that is, problems where programs must adjust how they respond to current inputs based on prior inputs. Indeed, the system could not evolve solutions to some context-dependent problems until regulation was added. Our implementation of tag-based genetic regulation is not universally beneficial, however. We identify scenarios where the correct response to a particular input never changes, rendering tag-based regulation an unneeded functionality that can sometimes impede adaptive evolution. Tag-based genetic regulation broadens our repertoire of techniques for evolving more dynamic genetic programs and can easily be incorporated into existing tag-enabled GP systems.

关键词： Tag-based referencing Gene regulation Linear genetic programming automatic program synthesis SignalGP

来源：评论

学校读者我要写书评

暂无评论

Model-based simulation of hydraulic hoses in an intelligent environment

引用

INTERNATIONAL JOURNAL OF FLUID POWER 2018年第1期19卷 27-41页

作者： Grossschmidt, Gunnar Harf, Mait Tallinn Univ Technol Dept Mech & Ind Engn Tallinn Estonia Tallinn Univ Technol Dept Software Sci Tallinn Estonia

In this paper, comprehensive mathematical models of hydraulic hoses for fluid power systems and a modelling and simulation technology based on using multi-pole models and intelligent simulation environment are proposed. Principles of composing multi-pole mathematical models for hydraulic hoses with lumped parameters having various causalities are discussed. Computing transient and frequency responses of hydraulic hoses in a visual simulation tool CoCoViLa are considered. The CoCoViLa environment is a visual programming tool, which supports declarative programming in a high-level language and automatic program synthesis. The proposed technology enables to find optimal solutions for hydraulic hoses in design and development of various fluid power systems.

关键词： Hydraulic hose multi-pole mathematical model CoCoViLa simulation environment visual task description automatic program synthesis

来源：评论

学校读者我要写书评

暂无评论

A MULTIPROCESSOR SYSTEM FOR DYNAMIC SYSTEM SIMULATION

引用

SIMULATION 1991年第1期56卷 31-40页

作者： MALBASA, V Institute of Computers and Control University of Novi Sad Novi Sad Yugoslavia

The basic goal of the project reported in this paper was to design and implement an experimental multimicroprocessor system dedicated to the real-time parallel simulation of dynamic systems of various degrees of complexity. The implemented multimicroprocessor called RAMS is also used to study the parallelization concepts of dynamic system models. Potential application of RAMS is in the process control area. The RAMS hardware architecture and software concepts, in particular the automatic synthesis of RAMS application software, are given in some detail. The problems of both task creation and scheduling in the non-deterministic RAMS environment are addressed. The experimental results show the power of RAMS through the parallel simulation of a case study dynamic system.

关键词： MULTIPROCESSORS REAL TIME SIMULATION automatic program synthesis

来源：评论

学校读者我要写书评

暂无评论

Modelling and simulation of hydraulic load-sensing systems using object-oriented programming environment

Modelling and simulation of hydraulic load-sensing systems u...

引用

19th European Conference on Modelling and Simulation (ECMS 2005)

作者： Grossschmidt, G Harf, M Tallinn Univ Technol Inst Cybernet EE-12618 Tallinn Estonia

来源：评论

学校读者我要写书评

暂无评论

Tag-based module regulation for genetic programming 22

Tag-based module regulation for genetic programming

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Lalejini, Alexander Moreno, Matthew Andres Ofria, Charles Univ Michigan Ann Arbor MI 48109 USA Michigan State Univ E Lansing MI USA

ISBN: (纸本)9781450392686

This Hot-off-the-Press paper summarizes our recently published work, "Tag-based regulation of modules in genetic programming improves context-dependent problem solving," published in Genetic programming and Evolvable Machines [1]. We introduce and experimentally demonstrate tag-based genetic regulation, a genetic programming (GP) technique that allows programs to dynamically adjust which code modules to express. Tags are evolvable labels that provide a flexible naming scheme for referencing code modules. Tag-based regulation extends tag-based naming schemes to allow programs to "promote" and "repress" code modules to alter module execution patterns. We find that tag-based regulation improves problem-solving success on problems where programs must adjust how they respond to current inputs based on prior inputs;indeed, some of these problems could not be solved until regulation was added. We also identify scenarios where the correct response to an input does not change over time, rendering tag-based regulation an unnecessary functionality that can sometimes impede evolution. Broadly, tag-based regulation adds to our repertoire of techniques for evolving more dynamic computer programs and can easily be incorporated into existing tag-enabled GP systems.

关键词： tag-based referencing gene regulation genetic programming automatic program synthesis SignalGP

来源：评论

学校读者我要写书评

暂无评论

Constructing programs from Example Computations

引用

IEEE Transactions on Software Engineering 1976年第3期SE-2卷 141-153页

作者： Biermann, Alan W. Krishnaswamy, Ramachandran Department of Computer Science Computation Center Duke University Durham NC 27706 United States Department of Computer Science Ohio State University Columbus OH 43210 United States

An autoprogrammer is an interactive computer programming system which automatically constructs computer programs from example computations executed by the user. The example calculations are done in a scratch pad fashion at a computer display using a light pen or other graphic input device, and the system stores a detailed history of all of the steps executed in the process. Then the system automatically synthesizes the shortest possible program which is capable of executing the observed examples. The paper describes the computational environment provided by the system, proves that the program synthesis technique is both “sound” and “complete,” describes the design of the system, and gives some programs it was used to create. Copyright © 1976 by The Institute of Electrical and Electronics Engineers, Inc.

关键词： automatic program synthesis autoprogramming induction techniques interactive graphics system interactive program construction program inference programming system

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：