On the enumeration of Boolean functions with distinguished variables

Boolean functions have a fundamental role in neural networks and machine learning. Enumerating these functions and significant subclasses is a highly complex problem. Therefore, it is of interest to study subclasses that escape this limitation and can be enumerated by means of sequences depending on...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Soft computing (Berlin, Germany) Jg. 25; H. 19; S. 12627 - 12640
1. Verfasser: Freixas, Josep
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2021
Schlagworte:
Artificial Intelligence
Computational Intelligence
Control
Engineering
Focus
Mathematical Logic and Foundations
Mechatronics
Robotics
Complete games
Boolean functions
Enumeration of Boolean functions
Dedekind’s problem
2-Monotonic Boolean functions
Simple games
ISSN:1432-7643, 1433-7479
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Boolean functions have a fundamental role in neural networks and machine learning. Enumerating these functions and significant subclasses is a highly complex problem. Therefore, it is of interest to study subclasses that escape this limitation and can be enumerated by means of sequences depending on the number of variables. In this article, we obtain seven new formulas corresponding to enumerations of some subclasses of Boolean functions. The versatility of these functions does the problem interesting to several different fields as game theory, hypergraphs, reliability, cryptography or logic gates.
ISSN:1432-7643
1433-7479
DOI:10.1007/s00500-020-05422-5