Skip to main content

Automated Problem Decomposition for the Boolean Domain with Genetic Programming

Otero, Fernando E.B., Johnson, Colin G. (2013) Automated Problem Decomposition for the Boolean Domain with Genetic Programming. In: 16th European Conference on Genetic Programming (EuroGP 2013). Lecture Notes in Computer Science . pp. 169-180. Springer ISBN 978-3-642-37206-3. E-ISBN 978-3-642-37207-0. (doi:10.1007/978-3-642-37207-0_15) (KAR id:42138)

PDF Author's Accepted Manuscript
Language: English
Download (200kB) Preview
[thumbnail of otero-eurogp2013_preprint.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL:


Researchers have been interested in exploring the regularities and modularity of the problem space in genetic programming (GP) with the aim of decomposing the original problem into several smaller subproblems. The main motivation is to allow GP to deal with more complex problems. Most previous works on modularity in GP emphasise the structure of modules used to encapsulate code and/or promote code reuse, instead of in the decomposition of the original problem. In this paper we propose a problem decomposition strategy that allows the use of a GP search to find solutions for subproblems and combine the individual solutions into the complete solution to the problem.

Item Type: Conference or workshop item (Paper)
DOI/Identification number: 10.1007/978-3-642-37207-0_15
Subjects: Q Science > Q Science (General) > Q335 Artificial intelligence
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Fernando Otero
Date Deposited: 07 Aug 2014 18:49 UTC
Last Modified: 16 Nov 2021 10:16 UTC
Resource URI: (The current URI for this page, for reference purposes)
Otero, Fernando E.B.:
Johnson, Colin G.:
  • Depositors only (login required):


Downloads per month over past year