{"id":"https://openalex.org/W2011318261","doi":"https://doi.org/10.1145/1569901.1570037","title":"Functional modularity for genetic programming","display_name":"Functional modularity for genetic programming","publication_year":2009,"publication_date":"2009-07-08","ids":{"openalex":"https://openalex.org/W2011318261","doi":"https://doi.org/10.1145/1569901.1570037","mag":"2011318261"},"language":"en","primary_location":{"id":"doi:10.1145/1569901.1570037","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1570037","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034406933","display_name":"Krzysztof Krawiec","orcid":"https://orcid.org/0000-0001-5439-3231"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Krzysztof Krawiec","raw_affiliation_strings":["Poznan University of Technology, PoznaD, Poland"],"affiliations":[{"raw_affiliation_string":"Poznan University of Technology, PoznaD, Poland","institution_ids":["https://openalex.org/I46597724"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058588690","display_name":"Bartosz Wieloch","orcid":"https://orcid.org/0000-0003-0104-8463"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Bartosz Wieloch","raw_affiliation_strings":["Poznan University of Technology, PoznaD, Poland"],"affiliations":[{"raw_affiliation_string":"Poznan University of Technology, PoznaD, Poland","institution_ids":["https://openalex.org/I46597724"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034406933"],"corresponding_institution_ids":["https://openalex.org/I46597724"],"apc_list":null,"apc_paid":null,"fwci":4.3618,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.94282675,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"995","last_page":"1002"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9807000160217285,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7199661731719971},{"id":"https://openalex.org/keywords/modularity","display_name":"Modularity (biology)","score":0.6849665641784668},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.6078764200210571},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.5773922801017761},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.5767724514007568},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5285469889640808},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.491553395986557},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4809212386608124},{"id":"https://openalex.org/keywords/fitness-function","display_name":"Fitness function","score":0.4804531931877136},{"id":"https://openalex.org/keywords/syntax","display_name":"Syntax","score":0.4626861810684204},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.37073031067848206},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.34977996349334717},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.23168838024139404},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22135218977928162},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.19641751050949097}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7199661731719971},{"id":"https://openalex.org/C2779478453","wikidata":"https://www.wikidata.org/wiki/Q6889748","display_name":"Modularity (biology)","level":2,"score":0.6849665641784668},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.6078764200210571},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.5773922801017761},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.5767724514007568},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5285469889640808},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.491553395986557},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4809212386608124},{"id":"https://openalex.org/C176066374","wikidata":"https://www.wikidata.org/wiki/Q629118","display_name":"Fitness function","level":3,"score":0.4804531931877136},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.4626861810684204},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.37073031067848206},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34977996349334717},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.23168838024139404},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22135218977928162},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.19641751050949097},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1569901.1570037","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1570037","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W146839677","https://openalex.org/W387729145","https://openalex.org/W1486903121","https://openalex.org/W1517016597","https://openalex.org/W1529442693","https://openalex.org/W1581584868","https://openalex.org/W1583889846","https://openalex.org/W1584428002","https://openalex.org/W1847072505","https://openalex.org/W1969543477","https://openalex.org/W2046483523","https://openalex.org/W2127338150","https://openalex.org/W2151554678","https://openalex.org/W2164305954","https://openalex.org/W2263500441","https://openalex.org/W2621208586","https://openalex.org/W4239615332","https://openalex.org/W6613289253","https://openalex.org/W6629118679"],"related_works":["https://openalex.org/W2561856575","https://openalex.org/W1792573625","https://openalex.org/W1925901016","https://openalex.org/W2097965245","https://openalex.org/W4294725171","https://openalex.org/W1485885287","https://openalex.org/W2553277926","https://openalex.org/W2139799987","https://openalex.org/W4384024076","https://openalex.org/W1578871554"],"abstract_inverted_index":{"In":[0,63,149,175],"this":[1,69],"paper":[2],"we":[3,52,106,153,177],"introduce,":[4],"formalize,":[5],"and":[6,80,123,138,163,202,210],"experimentally":[7],"validate":[8],"a":[9,30,50,58,120,124],"novel":[10],"concept":[11],"of":[12,32,60,68,90,93,103,126,132,141,167,171,188,214],"functional":[13],"modularity":[14,166],"for":[15,28,114,116,207],"Genetic":[16],"Programming":[17],"(GP).":[18],"We":[19],"rely":[20],"on":[21],"module":[22,85,145],"definition":[23],"that":[24,42,75,179],"is":[25,71,81,96,146],"most":[26],"natural":[27],"GP:":[29],"piece":[31],"program":[33],"code":[34],"(subtree).":[35],"However,":[36],"as":[37],"opposed":[38],"to":[39,83,100,109,161,192],"syntax-based":[40],"approaches":[41],"abstract":[43],"from":[44,135,198],"the":[45,65,88,91,101,130,139,142,144,150,165,195,199,212],"actual":[46],"computation":[47],"performed":[48],"by":[49],"module,":[51],"analyze":[53],"also":[54],"its":[55],"semantic":[56,79],"using":[57],"set":[59],"fitness":[61,104,140],"cases.":[62],"particular,":[64,176],"central":[66],"notion":[67],"approach":[70],"subgoal,":[72],"an":[73],"entity":[74],"embodies":[76],"module's":[77,136],"desired":[78],"used":[82,160,206],"evaluate":[84],"candidates.":[86],"As":[87],"cardinality":[89],"space":[92],"all":[94],"subgoals":[95,197],"exponential":[97],"with":[98,185],"respect":[99],"number":[102],"cases,":[105],"introduce":[107],"monotonicity":[108,128,180],"assess":[110],"subgoals'":[111],"potential":[112],"utility":[113],"searching":[115],"good":[117],"modules.":[118],"For":[119],"given":[121],"subgoal":[122],"sample":[125],"modules,":[127],"measures":[129],"correlation":[131],"subgoal's":[133],"distance":[134],"semantics":[137],"solution":[143],"part":[147,152],"of.":[148],"experimental":[151],"demonstrate":[154],"how":[155],"these":[156],"concepts":[157],"may":[158,203],"be":[159,204],"describe":[162],"quantify":[164],"two":[168,183],"simple":[169],"problems":[170,184],"Boolean":[172],"function":[173],"synthesis.":[174],"conclude":[178],"usefully":[181],"differentiates":[182],"different":[186],"nature":[187],"modularity,":[189],"allows":[190],"us":[191],"tell":[193],"apart":[194],"useful":[196],"other":[200],"ones,":[201],"potentially":[205],"problem":[208],"decomposition":[209],"enhance":[211],"efficiency":[213],"evolutionary":[215],"search.":[216]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}