Thank you so much for this content, you are preserving classical artificial intelligence very well through these videos, very clearly explained, thanks, man!
There is a step I do quite understand in the backwards-chaining, to prove P you need to prove L and M, but to prove L you need to prove P aswell right? since P ^ A -> L, or am I misunderstanding the tree?
Even though old I'll try. Is it given that because P->Q that is what we want to prove? Could there be another clause as C-> F, and then we would have to backtrack from both P-Q and C-> F? Or what would the approach be? I hope someone will answer :) Daniel.
1st) Why are L^M not L^M^A (by that long connection on the left side) implies by backwardchaining at 12:48 czcams.com/video/EZJs6w2YFRM/video.html? 2nd) Or may be it implied at 12:40 from the Q->P. In the video at this moment Q implies only P, but not [Q->P, Q->A) But I`m prone to my first statement because in forward chaining because at 7:41 we saw the same connection, which I have described in my 1st statemen/question.
i beg you please explain in english how to solve the problem of simple household robot of moving a desk from one room to another with two things on it using mean end analysis . The operators are PUSH,CARRY,WALK,PICKUP,PUTDOWN, and PLACE .
your videos are amazing man, I legitimately couldn't find anything as good as these stuff.
Thank you so much for this content, you are preserving classical artificial intelligence very well through these videos, very clearly explained, thanks, man!
What you are doing is pure magic!
Excellent!
Finally someone who looks to actually know about the topic. Thanks a ton!
Great explanation! Thank you for your time! :-)
Thank you so much for this! You are unequivocally better than my lecturers!
great explanation, keep up the good work
Couldn't be any better :D
Thanks
thank you for your explanation!especially, there is the caption that can help me to understand English
the best explanation i have had thank you soo much
Best explanation so far
This is so helpful. Thank you so much
Fantastic, thank you!
Great Example explanation. Thanks
This helped a lot, thank you! :)
Great explanation, thank u so much
Thank you. very helpful.
Very amazing, keep it up!
Really good video, i appreciate a lot ;)
you are amazing !!!!!
great tutorial on FC and BC
Thank you!
Great explanation brother
Thank you sir. Very useful.
Can't thank you more!
Thanks so much for saving my AI final exam!!!!
This explanation is way better than my lectueres.
Thank you
very helpful thanks!
hi, I have a question, how can you use modus ponens to a horn clause that has 0 positive literal? :)
thank you for the awesome video btw! :D
thank you very much
There is a step I do quite understand in the backwards-chaining, to prove P you need to prove L and M, but to prove L you need to prove P aswell right? since P ^ A -> L, or am I misunderstanding the tree?
thank you !!!
I highly regret for not finding your channel before my ai exams 🤧🤧
great explanation
hope I get an A+ tomorrow
Even though old I'll try.
Is it given that because P->Q that is what we want to prove? Could there be another clause as C-> F, and then we would have to backtrack from both P-Q and C-> F? Or what would the approach be?
I hope someone will answer :)
Daniel.
thanks
good video
ty
HELPER!!
Can someone point me to a nice pseudo code for backward chaining? I'm having trouble understanding the mechanics and AIMA doesn't have an example.
thanks sir
grazie
:) thanks!!!!!!!!!!!!!!!!!!
Very beautiful explanation , specially the last 2 sentences ... perfect for gaining intuition
1st) Why are L^M not L^M^A (by that long connection on the left side) implies by backwardchaining at 12:48 czcams.com/video/EZJs6w2YFRM/video.html?
2nd) Or may be it implied at 12:40 from the Q->P. In the video at this moment Q implies only P, but not [Q->P, Q->A)
But I`m prone to my first statement because in forward chaining because at 7:41 we saw the same connection, which I have described in my 1st statemen/question.
i beg you please explain in english how to
solve the problem of simple household robot of moving a desk from one room to another with two things on it using mean end analysis . The operators are PUSH,CARRY,WALK,PICKUP,PUTDOWN, and PLACE .
Do all ai stuffs please
wow! great explanation
But sorry to say that touch or tap sound when you write something on the screen is very annoying
You gotta cite the authors man... Russel and Norvig
ashish paudel Yes, the images and materials for the slides are largely taken from their book
USE REAL LIFE EXAMPLES!!!
good point. It is hard to do small real life examples. Ill try