Boolean Satisfiability Problem - Intro to Theoretical Computer Science

Показать описание

Рекомендации по теме

Комментарии

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.

keineangabe

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.

MrSumitHere

Can you tell me what you used to make the writing float? I would also like my videos to have a similar appearance. Thanks.

jojorocks

Thanks for the very useful explanation...I have an issue though: i can't see any buttons to choose at the end..

antoine

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.

Emc