The methods of constructing normal forms in the class of algebras are considered. Formulas of algebra describe Boolean images
We consider a class of formulas which consist of real functions a1,…,aN, their derivatives, and zero...
A pseudo-Boolean function (pBf) is a mapping from {0,1}^n to the real numbers. It is known that pseu...
AbstractWe consider a class of formulas which consist of real functions a1,…,aN, their derivatives, ...
The complete identities system of algebra U2 have been constructed in the paper. On the basis of the...
The truth table of a k-order Boolean function has 2^k rows. Its disjunctive normal form extracts all...
In discrete mathematics, minimizing Boolean functions in the class of disjunctive normal forms is on...
summary:In this paper, we deal with the disjunctive and conjunctive normal forms in the frame of pre...
We include the basic normal forms for propositional formulas. They are negative normal form, disjunc...
AbstractA new normal form of Boolean functions based on the sum (mod 2), product and negation is pre...
AbstractAfter showing that every pseudo-Boolean function (i.e. real-valued function with binary vari...
DI-algebra is a process algebra for delay-insensitive processes. Like in most process algebras, a no...
In logic, there are various normal forms for formulae; for example, disjunctive and conjunctive norm...
AbstractWe consider classes of real-valued functions of Boolean variables defined by disjunctive ana...
Abstract. In this article we apply the notion of the modified conjunctive normal form of a Boolean f...
Orthogonal forms of positive Boolean functions play an important role in reliability theory, since t...
We consider a class of formulas which consist of real functions a1,…,aN, their derivatives, and zero...
A pseudo-Boolean function (pBf) is a mapping from {0,1}^n to the real numbers. It is known that pseu...
AbstractWe consider a class of formulas which consist of real functions a1,…,aN, their derivatives, ...
The complete identities system of algebra U2 have been constructed in the paper. On the basis of the...
The truth table of a k-order Boolean function has 2^k rows. Its disjunctive normal form extracts all...
In discrete mathematics, minimizing Boolean functions in the class of disjunctive normal forms is on...
summary:In this paper, we deal with the disjunctive and conjunctive normal forms in the frame of pre...
We include the basic normal forms for propositional formulas. They are negative normal form, disjunc...
AbstractA new normal form of Boolean functions based on the sum (mod 2), product and negation is pre...
AbstractAfter showing that every pseudo-Boolean function (i.e. real-valued function with binary vari...
DI-algebra is a process algebra for delay-insensitive processes. Like in most process algebras, a no...
In logic, there are various normal forms for formulae; for example, disjunctive and conjunctive norm...
AbstractWe consider classes of real-valued functions of Boolean variables defined by disjunctive ana...
Abstract. In this article we apply the notion of the modified conjunctive normal form of a Boolean f...
Orthogonal forms of positive Boolean functions play an important role in reliability theory, since t...
We consider a class of formulas which consist of real functions a1,…,aN, their derivatives, and zero...
A pseudo-Boolean function (pBf) is a mapping from {0,1}^n to the real numbers. It is known that pseu...
AbstractWe consider a class of formulas which consist of real functions a1,…,aN, their derivatives, ...
DOI
Add to ORKG