Boolean Satisfiability Problem - Intro to Theoretical Computer Science

Поделиться
HTML-код
  • Опубликовано: 22 фев 2015
  • This video is part of an online course, Intro to Theoretical Computer Science. Check out the course here: www.udacity.com/course/cs313.

Комментарии • 41

  • @keineangabe1804
    @keineangabe1804 6 лет назад +225

    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.

    • @MykolaDolgalov
      @MykolaDolgalov 4 года назад +1

      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.

    • @7uv4n7
      @7uv4n7 4 года назад +2

      ruclips.net/video/Mu5HUvIojJA/видео.html link where he explains SAT problem

    • @cleverdamn
      @cleverdamn 3 года назад +5

      The Udacity

  • @MrSumitHere
    @MrSumitHere 5 лет назад +47

    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.

  • @vatexxx
    @vatexxx 7 лет назад +97

    but where is the sat problem?

    • @MykolaDolgalov
      @MykolaDolgalov 4 года назад +1

      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.

  • @01jojorocks
    @01jojorocks 3 года назад +2

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

  • @rafaelfernandez742
    @rafaelfernandez742 6 лет назад +35

    where is SAT problem?

    • @MykolaDolgalov
      @MykolaDolgalov 4 года назад

      In the next video on their YT channel.

  • @antoine7788
    @antoine7788 8 лет назад +15

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

    • @MykolaDolgalov
      @MykolaDolgalov 4 года назад

      You should access this course via Udacity learning platform to see those buttons.

  • @emersonzelaya54
    @emersonzelaya54 7 лет назад

    its true or 1.

  • @Emc4421
    @Emc4421 Год назад

    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.

  • @amaldaagi5450
    @amaldaagi5450 3 года назад

    give me an approximate satisfiability problem algorithm and thank you

  • @jonathanmarin8389
    @jonathanmarin8389 5 лет назад +3

    Where is the rest of the video?

    • @MykolaDolgalov
      @MykolaDolgalov 4 года назад

      On their YT channel and on Udacity web platform.

  • @HgKim90
    @HgKim90 7 лет назад +4

    ((True or False) or True ) and (False or True) ==> (True or true) and True ==> True and True ==> True.

  • @itzanitzit
    @itzanitzit 6 лет назад

    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

  • @paragggoyal1552
    @paragggoyal1552 Год назад

    what the hell? where is SAT in here?

  • @o10b7
    @o10b7 4 года назад

    Next video : ruclips.net/video/Mu5HUvIojJA/видео.html&feature=emb_logo

  • @LeoUfimtsev
    @LeoUfimtsev 4 года назад +2

    He he he... I see what you're trying to do here..

  • @salisuibrahim5392
    @salisuibrahim5392 6 лет назад

    true

  • @recessiv3
    @recessiv3 5 лет назад +1

    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

  • @maxwelljann5462
    @maxwelljann5462 5 лет назад

    tru

  • @7uv4n7
    @7uv4n7 4 года назад

    For anyone wondering what is SAT problem here it is ruclips.net/video/Mu5HUvIojJA/видео.html

  • @YanuarTriAdityaNugraha
    @YanuarTriAdityaNugraha 8 лет назад +11

    why there exist a dislike? this is a super good tutorial :(

    • @kunalbiswas1267
      @kunalbiswas1267 8 лет назад +3

      do u know anything?

    • @kunalbiswas1267
      @kunalbiswas1267 8 лет назад +2

      do u understand anything?

    • @9ShivamSharma
      @9ShivamSharma 6 лет назад +1

      he is good lol !
      - peace (ruclips.net/video/GM53mA5Boes/видео.html)

    • @Simppi96
      @Simppi96 5 лет назад +2

      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

    • @atikshaikh3121
      @atikshaikh3121 5 лет назад

      watch this: (ruclips.net/video/Gfgf1q-x1jk/видео.html) Please Help.

  • @keineangabe1804
    @keineangabe1804 6 лет назад

    This is the actually SAT explanation:
    ruclips.net/video/Mu5HUvIojJA/видео.html
    thank me later

  • @momenstaj9771
    @momenstaj9771 2 года назад

    Next video to explain SAT problem is here: ruclips.net/video/Mu5HUvIojJA/видео.html&ab_channel=Udacity

  • @crazydrifter13
    @crazydrifter13 4 года назад

    Answer is 1 but this isn't SAT. Incomplete video if title is kept in mind

  • @PowersOfTau
    @PowersOfTau 2 года назад

    Sat problem next video😅
    ruclips.net/video/Mu5HUvIojJA/видео.html

  • @ddiq47
    @ddiq47 3 года назад

    this looked so useful but it is not useful at all. :(