Mathematica 9 is now available
SEARCH MATHEMATICA 8 DOCUMENTATION
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Mathematica > Mathematics and Algorithms > Discrete Mathematics > Boolean Computation >
Mathematica > Mathematics and Algorithms > Logic & Boolean Algebra > Boolean Computation >
Built-in Mathematica SymbolSee Also »|More About »

SatisfiabilityInstances

SatisfiabilityInstances[bf]
attempts to find a choice of variables that makes the Boolean function bf yield True.
SatisfiabilityInstances[expr, {a1, a2, ...}]
attempts to find a choice of the ai that makes the Boolean expression expr be True.
SatisfiabilityInstances[b, ..., m]
attempts to find m choices of variables that yield True.
EXAMPLESCLOSE ALL
Basic Examples   (3)
Generate a single instance where the Boolean expression is true:
Generate multiple instances; in this case only two instances exist:
Find 3 instances for a pure Boolean function:
When the input is not satisfiable, an empty list is returned:
Generate a single instance where the Boolean expression is true:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
Generate multiple instances; in this case only two instances exist:
In[3]:=
Click for copyable input
Out[3]=
In[4]:=
Click for copyable input
Out[4]=
 
Find 3 instances for a pure Boolean function:
In[1]:=
Click for copyable input
Out[1]=
 
When the input is not satisfiable, an empty list is returned:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
Properties & Relations   (4)
A Boolean expression with n variables can have at most 2n instances:
Use SatisfiabilityCount to get an exact count of instances:
SatisfiabilityInstances corresponds to True entries in BooleanTable:
Use FindInstance to find solutions to equations and inequalities:
Neat Examples   (1)
A sampling of instances:
The full list is longer:
New in 7
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team