Model approach to grammatical evolution: theory and case study

Abstract

Many deficiencies with grammatical evolution (GE) such as inconvenience in solution derivations, modularity analysis, and semantic computing can partly be explained from the angle of genotypic representations. In this paper, we deepen some of our previous work in visualizing concept relationships, individual structures and total evolutionary process, contributing new ideas, perspectives, and methods in these aspects; reveal the principle hidden in early work so that to develop a practical methodology; provide formal proofs for issues of concern which will be helpful for understanding of mathematical essence of issues, establishing of Communicated by V. Loia. B Pei He an unified formal framework as well as practical implementation; exploit genotypic modularity like modular discovery systematically which for the lack of supporting mechanism, if not impossible, is done poorly in many existing systems, and finally demonstrate the possible gains through semantic analysis and modular reuse. As shown in this work, the search space and the number of nodes in the parser tree are reduced using concepts from building blocks, and concepts such as the codon-to-grammar mapping and the integer modulo arithmetic used in most existing GE can be abnegated.

Component-Based Verification Model of Sequential Programs

“…We have made first research attempt in some of these areas. In view of the fact that reusability, component-based development method are of increasingly important topics in computer community, we provided component-based framework in this work and [11]- [13] for verification and generation of programs. Reference paper [11] is the basis of [12]- [13] which provide model alternatives to grammar-based genetic programming, applying path searching techniques in program generations, but it also leaves behind many worthwhile problems.…”

“…Whether it is practicable to integrate these systems in a tightly coupled manner and technically how to achieve this end arouse great interest in computer community. This paper is a sister work of [11]- [13] that initiated studies on combination of Hoare's calculus [1], [3]- [6], model checking [7], [9], automaton [14]- [15] and genetic programming [16]- [18]. In reference paper [11], we have paid great attention to reusable technologies widely used in mathematics and software developments, proposing a formal framework to verify and evolutionally construct computer programs.…”

“…The measure employed is to construct transition systems over program components in terms of their semantic relations. Similarly, after introducing these techniques into genetic programming (GP) [18] as well as its important variant like grammatical evolution [16], [17], we obtained some formal GP frameworks [11]- [13]. These works make it possible to verify and generate programs in path checking and path searching technologies.…”

Cache Aided Decode‐and‐Forward Relaying Networks: From the Spatial View

“…Therefore, cooperative relaying is a significant technique in the current and future generations wireless networks, and the research on relaying networks has been active. The outage performance of multirelay networks was studied in [18,19], and the exact outage probabilities were derived. In [20], the authors turned to investigate the performance of relaying networks in terms of symbol error rate (SER).…”

Study on a storage location strategy based on clustering and association algorithms

“…A distance-metric-optimization-driven learning approach has been proposed to solve the problem of facial recognition across ages by integrating the traditional steps of the process with a deep convolutional neural network (Li et al 2018). The grammatical evolution of algorithms and programs has been analyzed (He et al 2016(He et al , 2017. The maximum duo-preservation string mapping problem and the minimum integral solution problem, which may be encountered in programming, have also been analyzed (Chen et al 2013(Chen et al , 2014.…”