An Algorithm for Constructing Reduced DNFs of Order-Convex Boolean Functions

This paper considers the problem of constructing reduced disjunctive normal forms of order-convex Boolean functions. An original algorithm is proposed for finding these forms. The algorithm uses concepts of the theory of ordered sets such as an ideal and a coideal and has a substantially lower time...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Cybernetics and systems analysis Jg. 55; H. 1; S. 30 - 33
1. Verfasser:	Timoshkin, A. I.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.01.2019 Springer Springer Nature B.V
Schlagworte:	Algorithms Artificial Intelligence Boolean Boolean algebra Boolean functions Control Mathematics Mathematics and Statistics Processor Architectures Software Engineering/Programming and Operating Systems Systems Theory implicant coideal ideal order-convex subset lattice
ISSN:	1060-0396, 1573-8337
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!