New approach of constant resolving of analytical programming

Abstract

This papers' aim is to provide the Artificial Intelligence community with a better tool for symbolic regression. In this paper, the method of analytical programming and constant resolving is revisited and extended. Nowadays, analytical programming mainly uses two methods for constant resolving. The first method is meta-evolution, in which the second evolutionary algorithm is used for constant resolving. The second method uses non-linear fitting algorithm. This paper reveals the third method, which use the basic mathematics to generate constants. The findings of this study have a number of important implications for future practice. © ECMS Thorsten Claus, Frank Herrmann, Michael Manitz, Oliver Rose (Editors).