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ženo v:
Podrobná bibliografie
Vydáno v:Cybernetics and systems analysis Ročník 55; číslo 1; s. 30 - 33
Hlavní autor: Timoshkin, A. I.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.01.2019
Springer
Springer Nature B.V
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 complexity than the classical Quine–McCluskey algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-019-00109-8