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, filling some of the major gaps. In the framework of the first review about the state of benchmarking in GP, logic synthesis (LS) was classified as one of the major GP problem domains. However, a diverse and accessible benchmark suite for LS is still missing. In this work, we propose a benchmark suite for LS that covers different types of Boolean functions that are commonly used in the field of GP. We analyze the complexity of the proposed benchmark by using popular complexity measures that are commonly used to classify and characterize Boolean functions and digital circuits.

Authors 6

1. Roman Kalkreuth

   Sorbonne Université

   Affiliation as printed

   Computer Lab of Paris 6, Sorbonne, University, Paris, France

2. Zdeněk Vašíček

   Brno University of Technology

   Affiliation as printed

   Brno University of Technology, Brno, Czech Republic

3. Jakub Husa

   Brno University of Technology

   Affiliation as printed

   Brno University of Technology, Brno, Czech Republic

4. Diederick Vermetten Aachen Leiden Institute of Advanced Computer Science

   Leiden University

   Affiliation as printed

   Leiden Institute of Advanced Computer Science, Leiden University, Leiden, Netherlands

5. Furong Ye Aachen Leiden Institute of Advanced Computer Science

   Leiden University

   Affiliation as printed

   Leiden Institute of Advanced Computer Science, Leiden University, Leiden, Netherlands

6. Thomas Bäck Aachen Leiden Institute of Advanced Computer Science

   Leiden University

   Affiliation as printed

   Leiden Institute of Advanced Computer Science, Leiden University, Leiden, Netherlands