Advances in Decision Sciences

Advances in Decision Sciences / 2005 / Article
Special Issue

Combinatorial Optimization

View this Special Issue

Open Access

Volume 2005 |Article ID 247409 |

Renato Bruni, "On the orthogonalization of arbitrary Boolean formulae", Advances in Decision Sciences, vol. 2005, Article ID 247409, 14 pages, 2005.

On the orthogonalization of arbitrary Boolean formulae

Received15 Oct 2002
Revised19 Mar 2004


The 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. Orthogonal 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 satisfiability problem. Therefore, important complexity issues are involved. A general procedure for transforming an arbitrary CNF or DNF to an orthogonal one is proposed. Such procedure is tested on randomly generated Boolean formulae.

Copyright © 2005 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

More related articles

113 Views | 357 Downloads | 2 Citations
 PDF Download Citation Citation
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.