Issue No. 03 - March (1979 vol. 28)
P.L. Hammer , Department of Combinatorics and Optimization, University of Waterloo
Given a monotone (nondecreasing) switching function F(x<inf>1</inf>,???,x<inf>n</inf>), its prime implicants are the minimal infeasible points, i.e., the minimal solutions to F(x) = 1. A monotone F is regular ifany "right shift" of a feasible point is again feasible. The roofs of a regular function F are those prime implicants al ofwhose right shifts are feasible. The set of these roofs completely
switching functions, Algorithm, dual, lexicographical ordering, prime implicants, regular, roofs and ceilings
U. Peled, M. Pollatschek and P. Hammer, "An Algorithm to Dualize a Regular Switching Function," in IEEE Transactions on Computers, vol. 28, no. , pp. 238-243, 1979.