findSubsets: Find all Possible Subsets of a Given Prime Implicant

Description

It is a general rule that all subsets can be found in the $n^k$ space, understood as all possible combinations of values in any combination of bases $n$, each causal condition having three or more levels (Dusa, 2007, 2010). If a prime implicant can be considered a superset of an initial combination of causal conditions, the reverse is also true: the initial combination is a subset of a prime implicant. Even more, a less minimum prime implicant (with more literals) is also a subset of another shorter (more minimum) prime implicant. This function finds all possible such subsets for a given prime implicant, in the $n^k$ space.

Usage

findSubsets(noflevels3k, row.no, maximum)

Arguments

noflevels3k

A vector containing the number of levels for each causal condition plus 1 (because all subsets are to be found in the higher "3k" matrix)

row.no

The row number where the (minimum) prime implicant is located

maximum

The maximum line number (subset) to be returned

Value

A vector with the line numbers of all possible subsets in the $prod(n)$ space.

References

A. Dusa. Enhancing Quine-McCluskey. WP 2007-49, COMPASSS, 2007. URL: http://www.compasss.org/files/WPfiles/Dusa2007a.pdf.

A. Dusa. A Mathematical Approach to the Boolean Minimization Problem. Quality & Quantity, 44(1): 99-113, 2010.

Examples

Run this code

# all three conditions are binary, having two levels: 0 and 1
noflevels <- c(2, 2, 2)

#  5  8 11 14 17 20 23 26
findSubsets(noflevels + 1, 2)

# stopping at maximum row number 20
# 5  8 11 14 17 20
findSubsets(noflevels + 1, 2, 20)