Boolean Normal Forms, Shellability, and Reliability Computations

Orthogonal forms of positive Boolean functions play an important role in reliability theory, since the probability that they take value 1 can be easily computed. However, few classes of disjunctive normal forms are known for which orthogonalization can be efficiently performed. An interesting class with this property is the class of shellable disjunctive normal forms (DNFs). In this paper, we present some new results about shellability. We establish that every positive Boolean function can be represented by a shellable DNF, we propose a polynomial procedure to compute the dual of a shellable DNF, and we prove that testing the so-called lexico-exchange (LE) property (a strengthening of shellability) is NP-complete.

[1]  J. Scott Provan.  Boolean Decomposition Schemes and the Complexity of Reliability Computations , 1989, Reliability Of Computer And Communication Networks.

[2]  Victor Klee,et al.  Convex polytopes and related complexes , 1996 .

[3]  Georg Gottlob,et al.  Identifying the Minimal Transversals of a Hypergraph and Related Problems , 1995, SIAM J. Comput..

[4]  George L. Nemhauser,et al.  Matroids and a Reliability Analysis Problem , 1979, Math. Oper. Res..

[5]  Elliott Mendelson.  Theory and problems of boolean algebra and switching circuits. , 1970 .

[6]  J. Scott Provan,et al.  Disjoint Products and Efficient Computation of Reliability , 1988, Oper. Res..

[7]  Leonid Khachiyan,et al.  On the Complexity of Dualization of Monotone Disjunctive Normal Forms , 1996, J. Algorithms.

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  D. R. Shier,et al.  Algorithms for Generating Minimal Cutsets by Inversion , 1985, IEEE Transactions on Reliability.

[10]  Victor Klee,et al.  Which Spheres are Shellable , 1978 .

[11]  M. O. Locks.  Inverting and Minimalizing Path Sets and Cut Sets , 1978, IEEE Transactions on Reliability.

[12]  Richard E. Barlow,et al.  Statistical Theory of Reliability and Life Testing: Probability Models , 1976 .

[13]  A. Björner.  Topological methods , 1996 .

[14]  Yves Crama,et al.  Dualization of regular Boolean functions , 1987, Discret. Appl. Math..

[15]  Toshihide Ibaraki,et al.  Complexity of Identification and Dualization of Positive Boolean Functions , 1995, Inf. Comput..

[16]  Antonio Sassano,et al.  An O(mn) Algorithm for Regular Set-Covering Problems , 1987, Theor. Comput. Sci..

[17]  M. O. Locks.  Recursive Disjoint Products: A Review of Three Algorithms , 1982, IEEE Transactions on Reliability.

[18]  K. Ramamurthy.  Coherent Structures and Simple Games , 1990 .

[19]  Anders Björner,et al.  Matroid Applications: Homology and Shellability of Matroids and Geometric Lattices , 1992 .

[20]  Saburo Muroga,et al.  Threshold logic and its applications , 1971 .

[21]  Bruno Simeone,et al.  Polynomial-time algorithms for regular set-covering and threshold synthesis , 1985, Discret. Appl. Math..

[22]  Vladimir Gurvich,et al.  On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions , 1999, Discret. Appl. Math..

[23]  Bruno Simeone,et al.  A O(nm)-Time Algorithm for Computing the Dual of a Regular Boolean Function , 1994, Discret. Appl. Math..

[24]  Peter L. Hammer,et al.  More characterizations of triangulated graphs , 1990, J. Graph Theory.