I know only basic math like so: (+,-,x,\,). And I studied a little bit of programming up to the point of knowing a little bit about Boolean values.I desperately want to understand the 3-sat question fully so I can solve it, but no one ever gives examples I can understand. Please give me a few example problems with full explanations on what they want, then give one example question that If solved will also solve 3-sat. I know they want someone to assign values to variables in a certain way to where the expression is always true,but I can't wrap my head around what that actually means? Other people have asked the same question as me and got a complicated explanation. Please explain to me as simple as possible how does 3-sat work? I know there was an example once that went something like this: A or B , C and D but not A. so the answer is obviously B ,C and D. They are asking about puting values in variables in a way were the expression always evaluates true, but I can't comprehend that concept to even try and solve. Please help. I've seen this example before x1∧x2∨x3 and I did a little research and I keep getting this symbol ^ with an explanation that says A and B are true if A and B are true. I get the logic of that statement but U don't get how those symbols make since in an example. Please clarify so that I can finally be able to try and solve it.I don't know much about c++ so please be sure to give an example problem fully explaining how it works. Thanks please don't tell that I shouldn't study this problem just because I don't know a lot of math. I'm sure I don't need to be a math or computer expert to figure out the basics and understanding of this problem so I can TRY and solve it.
2026-03-27 08:40:04.1774600804
How does 3-sat work in laymen's terms?
299 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMPUTER-SCIENCE
- What is (mathematically) minimal computer architecture to run any software
- Simultaneously multiple copies of each of a set of substrings of a string.
- Ackermann Function for $(2,n)$
- Algorithm for diophantine equation
- transforming sigma notation into harmonic series. CLRS A.1-2
- Show that if f(n) is O(g(n) and d(n) is O(h(n)), then f(n) + d(n) is O(g(n) + h(n))
- Show that $2^{n+1}$ is $O(2^n)$
- If true, prove (01+0)*0 = 0(10+0)*, else provide a counter example.
- Minimum number of edges that have to be removed in a graph to make it acyclic
- Mathematics for Computer Science, Problem 2.6. WOP
Related Questions in COMPUTABILITY
- Are all infinite sets of indices of computable functions extensional?
- Simple applications of forcing in recursion theory?
- Proof of "Extension" for Rice's Theorem
- How to interpret Matiyasevich–Robinson–Davis–Putnam in term of algebraic geometry or geometry?
- Does there exist a weakly increasing cofinal function $\kappa \to \kappa$ strictly below the diagonal?
- Why isn't the idea of "an oracle for the halting problem" considered self-contradictory?
- is there any set membership of which is not decidable in polynomial time but semidecidable in P?
- The elementary theory of finite commutative rings
- Is there any universal algorithm converting grammar to Turing Machine?
- Is the sign of a real number decidable?
Related Questions in NP-COMPLETE
- Divide set into two subsets of equal sum and maximum this sum
- Linear Programming Primal-Dual tough question
- Bipartite Graph Partitioning (special case)
- Minimise the sum of pairwise distances between labelled points in a metric space subject to covering some set of labels
- How should a chain of proof be written?
- Show the NP completeness of Hamiltonian Path with the knowledge of an directed Euler graph
- Integer Programming (non $0-1$) Reduction to show $NP$ Completeness
- Categories with at most one arrow between any pair of objects. (appears in NPC)
- Find a generalized path cover of a square graph
- Generalize minimum path cover
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
THE SHORT VERSION
3-SAT is basically a bunch of questions separated into groups of threes. If at least one in each group is true, we say it is satisfiable. If not, we say it's unsatisfiable.
THE LONG VERSION
AN EXAMPLE
For example, we can think of things in the kitchen. We can look at 4 things; an oven, a microwave, a toaster, and a refrigerator. Now we take groups of three of them. For example, we can take the oven, the microwave, and the toaster as one group. We can take the oven, the toaster, and the refrigerator as another group.
Now, we can ask if one in each group is on? Returning to our example, we ask
(is the oven on?) OR (is the microwave on?) OR (is the toaster on?)
...and for the other group
(is the oven on?) OR (is the toaster on?) OR (is the refrigerator on?)
That's how we get groups of 3 for 3-SAT. We combine them together to ask:
((is the oven on?) OR (is the microwave on?) OR (is the toaster on?))
AND
((is the oven on?) OR (is the toaster on?) OR (is the refrigerator on?))
That's the essence of 3-SAT. We use variables to represent the questions. So, for example, we could say that
$O$ means Is the oven on?
$M$ means Is the microwave on?
$T$ means Is the toaster on?
$R$ means Is the refrigerator on?
Then our example can be phrased like an equation:
((is the oven on?) OR (is the microwave on?) OR (is the toaster on?)) becomes ($O$ OR $M$ OR $T$)
((is the oven on?) OR (is the toaster on?) OR (is the refrigerator on?)) becomes ($O$ OR $T$ OR $R$)
COMBINING THINGS
So putting everything together, we have:
($O$ OR $M$ OR $T$) AND ($O$ OR $T$ OR $R$)
That's how we get the equation form of 3-SAT.
THE COMPLETE PROBLEM
There's one more thing we can do. We can ask the opposite. So instead of asking, "is the oven on?", we can ask "is the oven off?". We call "Is the oven on?" $O$, and we call "Is the oven off?" NOT $O$. So now we can say NOT $O$, NOT $M$, NOT $T$, NOT $R$ if we want.
Here's a sample equation of this:
($O$ OR $M$ OR (NOT $T$)) AND ($O$ OR (NOT $T$) OR $R$)
This is:
((is the oven on?) OR (is the microwave on?) OR (is the toaster OFF?)) becomes
($O$ OR $M$ OR (NOT $T$))
AND
((is the oven on?) OR (is the toaster OFF?) OR (is the refrigerator on?)) becomes
($O$ OR (NOT $T$) OR $R$)
That's the gist of it. It's really just making sure that at least one thing in each group of three is true. In other words, one thing in each group has a yes answer. If this is true, then we say the whole thing is true, or SATISFIABLE. If not, then we say the whole thing is false, or UNSATISFIABLE.