Add to ORKGThe orthogonal conjunctive normal form of a Boolean function is a conjunctive normal form in which any two clauses contain at least a pair of complementary literals. Orthog-onal disjunctive normal form is defined similarly. Orthogonalization is the process of transforming the normal form of a Boolean function to orthogonal normal form. The problem is of great relevance in several applications, for example, in the reliability theory. Moreover, such problem is strongly connected with the well-known propositional satis-fiability problem. Therefore, important complexity issues are involved. A general proce-dure for transforming an arbitrary CNF or DNF to an orthogonal one is proposed. Such procedure is tested on randomly generated Boolean formu...
In this paper we compare various normal form representations of Boolean functions. We extend the stu...
This paper reports a study that has established the possibility of reducing computational complexity...
The truth table of a k-order Boolean function has 2^k rows. Its disjunctive normal form extracts all...
An approach to solving the problem of orthogonalization of a disjunctive normal form (DNF) of a Bool...
Studio e sviluppo di algoritmi efficienti per trasformare una qualsiasi formula proposizionale in fo...
Orthogonal forms of positive Boolean functions play an important role in reliability theory, since t...
Orthogonal forms of positive Boolean functions play an important role in reliability theory, since t...
The problem of calculating the probability of a complex event presented by a special form of Boolean...
In this paper, a method called "Boolean subtraction" which enables the subtraction of two minterms a...
In discrete mathematics, minimizing Boolean functions in the class of disjunctive normal forms is on...
Abstract. In this article we apply the notion of the modified conjunctive normal form of a Boolean f...
In this paper, a method called “Boolean subtraction ” which enables the subtraction of two minterms ...
AbstractA new normal form of Boolean functions based on the sum (mod 2), product and negation is pre...
The orthogonalization of Boolean functions in disjunctive form, that means a Boolean function formed...
This paper reports a study that has established the possibility of reducing computational complexity...
In this paper we compare various normal form representations of Boolean functions. We extend the stu...
This paper reports a study that has established the possibility of reducing computational complexity...
The truth table of a k-order Boolean function has 2^k rows. Its disjunctive normal form extracts all...
An approach to solving the problem of orthogonalization of a disjunctive normal form (DNF) of a Bool...
Studio e sviluppo di algoritmi efficienti per trasformare una qualsiasi formula proposizionale in fo...
Orthogonal forms of positive Boolean functions play an important role in reliability theory, since t...
Orthogonal forms of positive Boolean functions play an important role in reliability theory, since t...
The problem of calculating the probability of a complex event presented by a special form of Boolean...
In this paper, a method called "Boolean subtraction" which enables the subtraction of two minterms a...
In discrete mathematics, minimizing Boolean functions in the class of disjunctive normal forms is on...
Abstract. In this article we apply the notion of the modified conjunctive normal form of a Boolean f...
In this paper, a method called “Boolean subtraction ” which enables the subtraction of two minterms ...
AbstractA new normal form of Boolean functions based on the sum (mod 2), product and negation is pre...
The orthogonalization of Boolean functions in disjunctive form, that means a Boolean function formed...
This paper reports a study that has established the possibility of reducing computational complexity...
In this paper we compare various normal form representations of Boolean functions. We extend the stu...
This paper reports a study that has established the possibility of reducing computational complexity...
The truth table of a k-order Boolean function has 2^k rows. Its disjunctive normal form extracts all...