Results 21 to 30 of about 1,765 (205)

On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions

Discrete Applied Mathematics, 1999
Let f:{0,1}n→{0,1} be a monotone Boolean function whose value at any point x∈{0,1}n can be determined in time t. Denote by the irredundant CNF of f, where C is the set of the prime implicates of f. Similarly, let be the irredundant DNF of the same function, where D is the set of the prime implicants of f.
Vladimir Gurvich, Leonid Khachiyan
openalex   +3 more sources

FPGA logic element for implementation of disjunctive normal form [PDF]

Izvestiâ vysših učebnyh zavedenij. Priborostroenie, 2017
Artem V. Grekov, Sergey F. Tyurin
openalex   +2 more sources

Determination of Significant Parameters on the Basis of Methods of Mathematical Statistics, and Boolean and Fuzzy Logic

Mathematics, 2022
Among the set of parameters for which data are collected for decision-making based on artificial intelligence methods, often only some of the parameters are significant.
Yulia Shichkina, Mikhail Petrov, Fatkieva Roza   +2 more
doaj   +1 more source

Logical minimization for combinatorial structure in FPGA

Informatika, 2021
The paper describes the research results of application efficiency of minimization programs of functional descriptions of combinatorial logic blocks, which are included in digital devices projects that are implemented in FPGA.
P. N. Bibilo, Yu. Yu. Lankevich, V. I. Romanov   +2 more
doaj   +1 more source

A Procedure for Calculating Logic Programs by Replacement of Formulae and Transformation to Disjunctive Normal Form.

Transactions of the Japanese Society for Artificial Intelligence, 2003
Taisuke Sato
exaly   +3 more sources

Disjunctive Bases: Normal Forms for Modal Logics

, 2017
We present the concept of a disjunctive basis as a generic framework for normal forms in modal logic based on coalgebra. Disjunctive bases were defined in previous work on completeness for modal fixpoint logics, where they played a central role in the proof of a generic completeness theorem for coalgebraic mu-calculi.
Sebastian Enqvist, Yde Venema
openalex   +5 more sources

The search for subsystems of related functions from multilevel representation of systems of Boolean functions1

Informatika, 2020
One of the directions of logical optimization of multilevel representations of systems of Boolean     functions is the methods based on the search of subsystems of functions that have the same parts in the domains of functions of selected subsystems ...
P. N. Bibilo, A. M. Pazniak
doaj   +1 more source

Minimization of binary decision diagrams for systems of completely defined Boolean functions using Shannon expansions and algebraic representations of cofactors

Informatika, 2021
In the systems of digital VLSI design (Very Large Integrated Circuits), the BDD (Binary Decision Diagram) is used for VLSI verification, as well as for technologically independent optimization as the first stage in the synthesis of logic circuits in ...
P. N. Bibilo, V. I. Romanov
doaj   +1 more source

On Complexity of Standard Forms for Multifunctions

Известия Иркутского государственного университета: Серия "Математика", 2017
Consider discrete functions defined on set A. In this case we define multifunctions as functions on set $2^A$. Values of a multifunction for inputs equal to one-element sets are given and values for other sets are calculated as a union of values on ...
A.S. Kazimirov
doaj   +1 more source

Application of Election Functions to Estimate the Number of Monotone Self-Dual Boolean functions

Моделирование и анализ информационных систем, 2022
One of the problems of modern discrete mathematics is R. Dedekind problem on the number of monotone boolean functions. For other precomplete classes, general formulas for the number of functions of the classes had been found, but it has not been found so
Leonid Y. Bystrov, Egor V. Kuzmin
doaj   +1 more source