The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Strongly Typed Genetic Programming
Abstract
Genetic programming is a powerful method for automatically generating computer programs via the process of natural selection (Koza, 1992). However, in its standard form, there is no way to restrict the programs it generates to those where the functions operate on appropriate data types. In the case when the programs manipulate multiple data types and contain functions designed to operate on particular data types, this can lead to unnecessarily large search times and/or unnecessarily poor generalization performance. Strongly typed genetic programming (STGP) is an enhanced version of genetic programming that enforces data-type constraints and whose use of generic functions and generic data types makes it more powerful than other approaches to type-constraint enforcement. After describing its operation, we illustrate its use on problems in two domains, matrix/vector manipulation and list manipulation, which require its generality. The examples are (1) the multidimensional least-squares regression problem, (2) the multidimensional Kalman filter, (3) the list manipulation function NTH, and (4) the list manipulation function MAPCAR.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A New Approach to Linear Filtering and Prediction Problems
Kalman, R. E. (1960) · Journal of Basic Engineering · doi:10.1115/1.3662552 · Cited by 31,751
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
Uniform crossover in genetic algorithms
Syswerda, G. (1989) · international conference on Genetic algorithms · Cited by 1,965
Genetic programming II: Automatic discovery of reusable programs
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90099-3 · Cited by 1,901
Generalized Inverses of Linear Transformations
Campbell, S. L., & Meyer, C. D. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719048 · Cited by 1,897
Kernighan, B. W., & Ritchie, D. M. (1978) · Cited by 1,857
Genetic Algorithms and Simulated Annealing
Davis, L. D. (1987) · Cited by 1,759
Proceedings of the third international conference on Genetic algorithms
Schaffer, J. D. (1989) · international conference on Genetic algorithms · Cited by 1,280
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 825
Cited by
Grammar-based Genetic Programming: a survey
McKay, R. I., Hoai, N. X., Whigham, P. A., Shan, Y., & O’Neill, M. (2010) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-010-9109-y · Cited by 377
A Survey of Evolutionary Algorithms for Decision-Tree Induction
Barros, R. C., Basgalupp, M. P., de Carvalho, A. C. P. L. F., & Freitas, A. A. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2011.2157494 · Cited by 346
Open issues in genetic programming
O’Neill, M., Vanneschi, L., Gustafson, S., & Banzhaf, W. (2010) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-010-9113-2 · Cited by 224
Manahov*, V. (2016) · Financial Review · doi:10.1111/fire.12103 · Cited by 32
Metadata
- Authors
- Montana, D. J.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press - Journals
- Published
- 1995-06
- Volume
- 3
- Issue
- 2
- Pages
- 199-230
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W2027649639
- Cited by
- 916
- References
- 12
- FWCI
- 22.02
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Strongly Typed Genetic Programming. https://app.cochat.ai/papers/10.1162/evco.1995.3.2.199
- The paper
- Montana, D. J. (1995). Strongly Typed Genetic Programming. Evolutionary Computation. https://doi.org/10.1162/evco.1995.3.2.199
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
