Видео

Thanks voor de uitleg!

0:43 rightmost parenthesis is missing

Thank you so much ! This is so very helpful

what does the notation mean <- mean?

Clearest explanation I could find, thank you

07:58 **Algorithm**: Scenario: [t/u] … Given two formulas `t` and `u` we want to know if they have a MGU. * Rule 1) if `f(t₁, …, tₙ)/f(u₁, …, uₙ)` (t and u are the same size) then `[t₁/u₁, …, tₙ/uₙ]` (break open the equation and compare). * Rule 2) if `g≠f` or `n≠m` in `f(t₁, …, tₙ)/g(u₁, …, uₘ)` then FAIL (→ no MGU exists). * Rule 3) if `X/X` (exactly the same) then remove (them from list) and continue. * Rule 4) if `X/f(t₁, …, tₙ)` then `f(t₁, …, tₙ)/X` (you can switch them around). * Rule 5) if `X ∉ (t₁, …, tₙ)` in `f(t₁, …, tₙ)/X` then replace `X` everywhere with `f(t₁, …, tₙ)` except in `f(t₁, …, tₙ)/X`. * Rule 6) if `X ∈ (t₁, …, tₙ)` in `f(t₁, …, tₙ)/X` then FAIL (→ no MGU exists). 13:45 **Example**: - [t/u] = [ q(a, g(X,a), f(Y)) / q(a, g(f(b),a), X) ] - R1: [ a/a, g(X,a)/g(f(b),a), f(Y)/X ] - R2: [ g(X,a)/g(f(b),a), f(Y)/X ] - R1: [ X/f(b), a/a, f(Y)/X ] - R4: [ f(b)/X, a/a, f(Y)/X ] - R5: [ f(b)/X, a/a, f(Y)/f(b) ] - R3: [ f(b)/X, f(Y)/f(b) ] - R1: [ f(b)/X, Y/b ] - R4: [ f(b)/X, b/Y ] MGU = [ f(b)/X, b/Y ]

Please Keep posting more videos on logics.. ...

Great video, thank you :)

Thank you so much! After listening your class, I can figure out the mgu and it's algorithm.

this guy is explaining brilliantly!!

Excellent introduction!

Thanks a lot Raoul. Very helpful.

Thank you Raoul!

Lol I just realised this was published on 12/12/12

OMG! I'm sorry but you sound EXACTLY like a young Walter Lewin! 🤩

Thanks!...this is the best explanation

Pretty decent english for a dutch boy, could recognise that accent anywhere

GOD. FUCKING. BLESS YOU. YOU'VE SAVED MY ASS

Thanks mate using the algorithm slide for exam today :p

how did u replace f(y) with y and f(b) with b

Saved me a headache

propositional resolution on 9:40 min.

Much useful than the notes I got from lecturer, thanks

You speak very well in English, don't worry about it! :D Thank you so much for this video

.............................mother of god

Thanks, better explained than my text book to be honest.

*KEANU REEVES* teaching unification ... This should be fun ...

Great explanation! Thanks

THANK YOU A LOT!!!!!!!! NOW I UNDERSTAND THIS PART!!!!!! YOU ARE PERFECT TEACHER!!!!

u look like tom odell lol

can u plz make a video how to proof a statement by resolution? AI

Thanks Raoul!

thank you that was very useful :)

thanx mate. that was really helpful

very good

thank you

Thank you so much! I am suffering in my Logics class at Uni because my professor is an utterly useless man. His English is extremely poor so all my brain power during his lectures is spent trying to decipher his words, all of his handouts are plagiarized Frankensteins of other textbooks. And he is never available for one-on-one meetings. Your videos are my only real hope of passing.

thank you it was really helpful :)

thank you so much ....really helpful

Thanks for the great explanation, but those unmatched parentheses are bothering my pseudo-ocd :D

Thats a very clear explanation how to use that algorithm. Now I must hope that my teacher will accept that notification.

thanks, was realy good

Thanks a lot mate, really helpful.

At the very end, why did you swap y and b? I thought the rule only said you had to move function to left side.

Loved this. <3 I kind of knew unification, but the rules were always so poorly explained. This cleared it up a lot, thanks. :)

Good explanation, thank you

At 19:45, why can you break open the f? Why is there no rule about that listed on the page of the algorithm (13:42) ? You said because (like first rule on 13:42) both are f and have the same size (=number of arguments). But does that "breaking up" only work with functions of 1 argument? You should say that. And put it on the page about the algorithm (13:42).

good explanation

You might consider crossing your Zs. They look like 2s to me. =)

Excellent video. I have been looking for an explanation of resolution all night! Thank you.