Towards a General Boolean Function Benchmark Suite
Abstract
Just over a decade ago, the first comprehensive review on the state of benchmarking in Genetic Programming (GP) analyzed the mismatch between the problems that are used to test the performance of GP systems and real-world problems. Since then, several benchmark suites in major GP problem domains have been proposed over time, which were able to fill some of the major gaps. In the framework of the first review about the state of benchmarking in GP, logic synthesis was classified as one of the major GP problem domains. However, a diverse and accessible benchmark suite for logic synthesis is still missing in the field of GP. In this work, we take a first step towards a benchmark suite for logic synthesis that covers different types of Boolean functions that are commonly used for the evaluation of GP systems. We also present baseline results that have been obtained by former work and in our evaluation experiments by using Cartesian Genetic Programming.
Authors 6
-
Affiliation as printed
Leiden Institute of Advanced Computer Science, Leiden, Netherlands
-
Affiliation as printed
Brno University of Technology, Brno, Czech Republic
-
Affiliation as printed
Brno University of Technology, Brno, Czech Republic
-
Affiliation as printed
Leiden Institute of Advanced Computer Science, Leiden, Netherlands
-
Affiliation as printed
Leiden Institute of Advanced Computer Science, Leiden, Netherlands
-
Affiliation as printed
Leiden Institute of Advanced Computer Science, Leiden, Netherlands
Cited by 2 stored of 2
2 results
No patents citing this paper on Lens.org (checked 2026-10-11).
References 24
-
W3097981844details pending0citations