{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T10:55:26Z","timestamp":1771930526832,"version":"3.50.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Statutory Funds of Poznan University of Technology"},{"DOI":"10.13039\/501100004281","name":"National Science Centre, Poland","doi-asserted-by":"publisher","award":["2018\/29\/N\/ST6\/01646"],"award-info":[{"award-number":["2018\/29\/N\/ST6\/01646"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"name":"EU Horizon 2020 Research and Innovation Program through TAILOR Project","award":["GA 952215"],"award-info":[{"award-number":["GA 952215"]}]},{"name":"Polish Ministry of Education and Science","award":["0311\/SBAD\/0709"],"award-info":[{"award-number":["0311\/SBAD\/0709"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1109\/tevc.2022.3205286","type":"journal-article","created":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T19:56:20Z","timestamp":1662666980000},"page":"1327-1339","source":"Crossref","is-referenced-by-count":4,"title":["Counterexample-Driven Genetic Programming for Symbolic Regression With Formal Constraints"],"prefix":"10.1109","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1991-8797","authenticated-orcid":false,"given":"Iwo","family":"B\u0142\u0105dek","sequence":"first","affiliation":[{"name":"Institute of Computing Science, Poznan University of Technology, Poznań, Poland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5439-3231","authenticated-orcid":false,"given":"Krzysztof","family":"Krawiec","sequence":"additional","affiliation":[{"name":"Institute of Computing Science, Poznan University of Technology, Poznań, Poland"}]}],"member":"263","reference":[{"key":"ref13","first-page":"825","article-title":"Satisfiability modulo theories","volume":"185","author":"barrett","year":"2009","journal-title":"Handbook of Satisfiability"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1162\/evco_a_00228","article-title":"Counterexample-driven genetic programming: Heuristic program synthesis from formal specifications","volume":"26","author":"b??dek","year":"2018","journal-title":"Evol Comput"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2330784.2330846"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1995376.1995394"},{"key":"ref30","author":"dua","year":"2017","journal-title":"UCI Machine Learning Repository"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071224"},{"key":"ref10","article-title":"The SMT-LIB standard: Version 2.0","author":"barrett","year":"2010","journal-title":"Proc 8th Int Workshop Satisfiabil Modulo Theories"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2496(92)90029-7"},{"key":"ref1","first-page":"977","article-title":"Solving symbolic regression problems with formal constraints","author":"b??dek","year":"2019","journal-title":"Proc Genet Evol Comput Conf (GECCO)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71605-1_11"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908898"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.140.5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-011-4200-4"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330273"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375599"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"ref25","article-title":"Language to specify syntax-guided synthesis problems","author":"raghothaman","year":"2014","journal-title":"arXiv 1405 5590"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-016-0418-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168907"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.12.019"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1080\/03610918.2014.931971"},{"key":"ref27","author":"de moura","year":"2020","journal-title":"Z3 theorem prover Github repository"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205539"},{"key":"ref8","first-page":"1","article-title":"A linear programming formulation for global inference in natural language tasks","author":"roth","year":"2004","journal-title":"Proc HLT-NAACL Workshop 8th Conf Comput Nat Lang Learn (CoNLL)"},{"key":"ref7","first-page":"357","article-title":"Learning hebrew roots: Machine learning with linguistic constraints","author":"daya","year":"2004","journal-title":"Proc Conf Empir Methods Nat Lang Process ACL"},{"key":"ref9","author":"barrett","year":"2016","journal-title":"The Satisfiability Modulo Theories Library (SMT-LIB)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3351095.3372830"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2013.6679385"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/02664763.2021.1946020"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(05)80038-6"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/10269088\/09881536.pdf?arnumber=9881536","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T18:11:10Z","timestamp":1698084670000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9881536\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10]]},"references-count":30,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2022.3205286","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10]]}}}