sorry but this has nothing to do with SAT. It explains the basic of Boolean algebra, which is nice, but not how SAT checking works or even what it does or why you need to do it. Next time please make the video longer or put a link in the description.
This video is a part of a course that you can access from Udacity. You can find the follow-up parts of this video on their youtube channel. They give us this content for free, which is good. They don't close it with a pay-wall.
This video only lacks these lines at the end of it - Satisfiability asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE. If this is the case, the formula is called satisfiable. On the other hand, if no such assignment exists, the function expressed by the formula is FALSE for all possible variable assignments and the formula is unsatisfiable.
This would be true. (x1 v not x2) is (1 v 0) which is 1. so we have (1 v x3) which is 1. so we have (1) AND (x1 not v x2) which by definition is 1. so we have (1) intersect (1) which is 1. But it’s late and I have a feeling if I look deeper there’s a paradox somewhere.
It is good for understanding boolean formulas, but it doesn't explain anything about the SAT problem. It only says that SAT stands for "Boolean Satisfiability", but that isn't really helpful for getting a deeper understanding of the characteristics of the problem
sorry but this has nothing to do with SAT. It explains the basic of Boolean algebra, which is nice, but not how SAT checking works or even what it does or why you need to do it. Next time please make the video longer or put a link in the description.
This video is a part of a course that you can access from Udacity. You can find the follow-up parts of this video on their youtube channel. They give us this content for free, which is good. They don't close it with a pay-wall.
ruclips.net/video/Mu5HUvIojJA/видео.html link where he explains SAT problem
The Udacity
This video only lacks these lines at the end of it - Satisfiability asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE. If this is the case, the formula is called satisfiable. On the other hand, if no such assignment exists, the function expressed by the formula is FALSE for all possible variable assignments and the formula is unsatisfiable.
but where is the sat problem?
In the next videos of this series. It's a part of a course on Udacity. They have it all on their YT channel, not difficult to find.
Can you tell me what you used to make the writing float? I would also like my videos to have a similar appearance. Thanks.
where is SAT problem?
In the next video on their YT channel.
Thanks for the very useful explanation...I have an issue though: i can't see any buttons to choose at the end..
You should access this course via Udacity learning platform to see those buttons.
its true or 1.
This would be true. (x1 v not x2) is (1 v 0) which is 1. so we have (1 v x3) which is 1. so we have (1) AND (x1 not v x2) which by definition is 1. so we have (1) intersect (1) which is 1.
But it’s late and I have a feeling if I look deeper there’s a paradox somewhere.
give me an approximate satisfiability problem algorithm and thank you
Where is the rest of the video?
On their YT channel and on Udacity web platform.
((True or False) or True ) and (False or True) ==> (True or true) and True ==> True and True ==> True.
Make to follow the link to the videos that follow (seems like this is just the very start of an intro): ruclips.net/video/Mu5HUvIojJA/видео.html
what the hell? where is SAT in here?
Next video : ruclips.net/video/Mu5HUvIojJA/видео.html&feature=emb_logo
He he he... I see what you're trying to do here..
true
If you're having trouble with the symbols, you can replace ^ (and) with * (multiply) and V (or) with + (add). Note, 1+1=1 in this case
tru
For anyone wondering what is SAT problem here it is ruclips.net/video/Mu5HUvIojJA/видео.html
why there exist a dislike? this is a super good tutorial :(
do u know anything?
do u understand anything?
he is good lol !
- peace (ruclips.net/video/GM53mA5Boes/видео.html)
It is good for understanding boolean formulas, but it doesn't explain anything about the SAT problem. It only says that SAT stands for "Boolean Satisfiability", but that isn't really helpful for getting a deeper understanding of the characteristics of the problem
watch this: (ruclips.net/video/Gfgf1q-x1jk/видео.html) Please Help.
This is the actually SAT explanation:
ruclips.net/video/Mu5HUvIojJA/видео.html
thank me later
Next video to explain SAT problem is here: ruclips.net/video/Mu5HUvIojJA/видео.html&ab_channel=Udacity
Answer is 1 but this isn't SAT. Incomplete video if title is kept in mind
Sat problem next video😅
ruclips.net/video/Mu5HUvIojJA/видео.html
this looked so useful but it is not useful at all. :(