Publication detail

General Boolean Function Benchmark Suite

KALKREUTH, R. VAŠÍČEK, Z. HUSA, J. VERMETTEN, D. YE, F. THOMAS, B.

Original Title

General Boolean Function Benchmark Suite

Type

conference paper

Language

English

Original 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.

Keywords

genetic programming, logic synthesis, benchmark

Authors

KALKREUTH, R.; VAŠÍČEK, Z.; HUSA, J.; VERMETTEN, D.; YE, F.; THOMAS, B.

Released

30. 8. 2023

Publisher

Association for Computing Machinery

Location

Potsdam

ISBN

979-8-4007-0202-0

Book

FOGA 2023 - Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms

Pages from

84

Pages to

95

Pages count

12

BibTex

@inproceedings{BUT185171,
  author="KALKREUTH, R. and VAŠÍČEK, Z. and HUSA, J. and VERMETTEN, D. and YE, F. and THOMAS, B.",
  title="General Boolean Function Benchmark Suite",
  booktitle="FOGA 2023 - Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms",
  year="2023",
  pages="84--95",
  publisher="Association for Computing Machinery",
  address="Potsdam",
  doi="10.1145/3594805.3607131",
  isbn="979-8-4007-0202-0"
}