{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:34:36Z","timestamp":1758274476748},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>First-order theorem provers have to search for proofs in an infinite<\/jats:p><jats:p>space of possible derivations. Proof search heuristics play a vital<\/jats:p><jats:p>role for the practical performance of these systems. In the current<\/jats:p><jats:p>generation of saturation-based theorem provers like SPASS, E,<\/jats:p><jats:p>Vampire or Prover~9, one of the most important decisions is the<\/jats:p><jats:p>selection of the next clause to process with the given clause<\/jats:p><jats:p>algorithms. Provers offer a wide variety of basic clause evaluation<\/jats:p><jats:p>functions, which can often be parameterized and combined in many<\/jats:p><jats:p>different ways. Finding good strategies is usually left to the users<\/jats:p><jats:p>or developers, often backed by large-scale experimental<\/jats:p><jats:p>evaluations. We describe a way to automatize this process using<\/jats:p><jats:p>genetic algorithms, evaluating a population of different strategies<\/jats:p><jats:p>on a test set, and applying mutation and crossover operators to good<\/jats:p><jats:p>strategies to create the next generation. We describe the design and<\/jats:p><jats:p>experimental set-up, and report on first promising results.<\/jats:p>","DOI":"10.29007\/gms9","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:04:14Z","timestamp":1516748654000},"source":"Crossref","is-referenced-by-count":2,"title":["Breeding Theorem Proving Heuristics with Genetic Algorithms"],"prefix":"10.29007","author":[{"given":"Simon","family":"Sch\u00e4fer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"GCAI 2015. Global Conference on Artificial Intelligence"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:04:17Z","timestamp":1516748657000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/M5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/gms9","relation":{},"ISSN":["2398-7340"],"issn-type":[{"value":"2398-7340","type":"print"}],"subject":[]}}