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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Cybernetics and systems analysis Ročník 55; číslo 1; s. 30 - 33
Hlavný autor:	Timoshkin, A. I.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.01.2019 Springer Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!