counts the number of possible combinations of variable values that yield True when supplied as arguments to the Boolean function bf.
counts the number of possible combinations of the ai that make the Boolean expression expr be true.
Examplesopen allclose all
Basic Examples (3)
This corresponds to the number of times True appears in the truth table:
Properties & Relations (11)
SatisfiabilityCount for a function of variables is always between and :
In this case, the BooleanTable would have elements:
For Or it is :
For Nand it is :
For Nor it is :
For Xor it is :
For Xnor it is :
For Equivalent it is :
For Majority it is for odd and for even :
The size of the truth set for BooleanCountingFunction can be given by a combinatorial sum:
For BooleanMaxterms it is given by 2n minus the length of the index list:
Use SatisfiabilityInstances to find explicit instances:
Use CountRoots to count the number of polynomial roots in a real interval:
Wolfram Research (2008), SatisfiabilityCount, Wolfram Language function, https://reference.wolfram.com/language/ref/SatisfiabilityCount.html.
Wolfram Language. 2008. "SatisfiabilityCount." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/SatisfiabilityCount.html.
Wolfram Language. (2008). SatisfiabilityCount. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/SatisfiabilityCount.html