- Functions
- AllTrue
- And
- AnyTrue
- BitAnd
- BitLength
- BitOr
- BitSet
- BitShiftLeft
- BitXor
- Boole
- BooleanConsecutiveFunction
- BooleanConvert
- BooleanCountingFunction
- BooleanFunction
- BooleanMaxterms
- BooleanMinimize
- BooleanMinterms
- BooleanTable
- BooleanVariables
- CellularAutomaton
- Conjunction
- Disjunction
- Equivalent
- Exists
- False
- FindClusters
- ForAll
- HammingDistance
- Implies
- LogicalExpand
- Majority
- MatchingDissimilarity
- Maximize
- Minimize
- Nand
- Nearest
- NoneTrue
- Nor
- Not
- Or
- Resolve
- RulePlot
- SatisfiabilityCount
- SatisfiabilityInstances
- SatisfiableQ
- ShiftRegisterSequence
- SubstitutionSystem
- TautologyQ
- True
- TuringMachine
- UnateQ
- Xnor
- Xor
- Related Guides
- Tech Notes
- Functions
- AllTrue
- And
- AnyTrue
- BitAnd
- BitLength
- BitOr
- BitSet
- BitShiftLeft
- BitXor
- Boole
- BooleanConsecutiveFunction
- BooleanConvert
- BooleanCountingFunction
- BooleanFunction
- BooleanMaxterms
- BooleanMinimize
- BooleanMinterms
- BooleanTable
- BooleanVariables
- CellularAutomaton
- Conjunction
- Disjunction
- Equivalent
- Exists
- False
- FindClusters
- ForAll
- HammingDistance
- Implies
- LogicalExpand
- Majority
- MatchingDissimilarity
- Maximize
- Minimize
- Nand
- Nearest
- NoneTrue
- Nor
- Not
- Or
- Resolve
- RulePlot
- SatisfiabilityCount
- SatisfiabilityInstances
- SatisfiableQ
- ShiftRegisterSequence
- SubstitutionSystem
- TautologyQ
- True
- TuringMachine
- UnateQ
- Xnor
- Xor
- Related Guides
- Tech Notes
- Functions
Boolean Computation
Building on its core symbolic architecture, the Wolfram Language gives immediate access to the latest in industrial-strength Boolean computation. With highly general symbolic representations of Boolean functions, with full support for "don't-care" arguments and values, the Wolfram Language provides state-of-the-art Boolean function transformation, minimization, elimination, satisfiability, and analysis, making possible verification, testing, and other applications involving hundreds to hundreds of thousands of variables.
Basic Boolean Operators
And(&&,∧) ▪ Or(||,∨) ▪ Not(!,¬) ▪ Nand(⊼) ▪ Nor(⊽) ▪ Xor(⊻)▫Xnor() ▪ Implies() ▪ Equivalent(⧦) ▪ Majority
True,False— symbolic truth values
Boole— convert symbolic truth values to 0 and 1
Special Boolean Functions
BooleanCountingFunction—
out of
variables true
BooleanConsecutiveFunction— consecutive
out of
variables true
General Boolean Functions
BooleanFunction— general Boolean function (from IDs, mappings with "don't cares", ...)
BooleanMinterms,BooleanMaxterms— combinations of minterms, maxterms
Conjunction,Disjunction— AND, OR with respect to a list of variables (cf.∑,∏)
Predicates on Lists
Boolean Structure
BooleanTable— create a truth vector or general truth table
BooleanVariables— find the variables in a Boolean expression
UnateQ— test whether a Boolean expression is unate (monotone)
Visualization
RulePlot— visualize a Boolean function
Conversion & Minimization
BooleanConvert— convert to a specified format (CNF, DNF, ESOP, NOR, BFF, ...)
BooleanMinimize— find a minimal Boolean form
Boolean Function Testing
SatisfiableQ— test whether any input to a function can giveTrue
SatisfiabilityCount— count how many possible inputs giveTrue
SatisfiabilityInstances— find instances of inputs that giveTrue
TautologyQ— test whether all possible inputs giveTrue
Predicate Calculus
ForAll (∀),Exists (∃)— quantify over Boolean variables
Resolve— eliminate quantified variables from a Boolean expression
LogicalExpand— expand expressions involving Boolean operators and equations
Iterated Boolean Systems»
CellularAutomaton ▪ TuringMachine ▪ SubstitutionSystem ▪ ShiftRegisterSequence
Bit Vector Operations»
BitAnd ▪ BitOr ▪ BitXor ▪ BitLength ▪ BitShiftLeft ▪ BitSet ▪ ...
Numerical Boolean Computation
Nearest,FindClusters— operate on Boolean vectors
Related Tech Notes
Related Guides
[8]ページ先頭