Wolfram Mathematica Documentation Center
DOCUMENTATION CENTER SEARCH
New to Mathematica? Find your learning path »
Mathematica > Mathematics and Algorithms > Discrete Mathematics > Boolean Computation > SatisfiableQ >
Mathematica > Mathematics and Algorithms > Logic & Boolean Algebra > Boolean Computation > SatisfiableQ >
Mathematica > Mathematics and Algorithms > Graphs & Networks > Graph Programming > Boolean Computation > SatisfiableQ >
BUILT-IN MATHEMATICA SYMBOLSee Also »|More About »

SatisfiableQ

SatisfiableQ[bf]
gives True if a combination of values of variables exists that makes the Boolean function bf yield True.
SatisfiableQ
gives True if a combination of values of the exists that makes the Boolean expression expr yield True.
EXAMPLESCLOSE ALL
Basic Examples   (2)
Test whether Boolean expressions are satisfiable:
Test whether pure Boolean functions are satisfiable:
Test whether Boolean expressions are satisfiable:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
 
Test whether pure Boolean functions are satisfiable:
In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
Properties & Relations   (4)
An expression is satisfiable if it is true for some variable assignments:
An expression of variables is satisfiable if the SatisfiabilityCount is greater than 0:
Use SatisfiabilityInstances to get explicit instances:
SatisfiableQ[f] is equivalent to ¬TautologyQ[¬f]:
New in 7
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF