Resolution Tree sum with solved example in Artificial Intelligence (HINDI)
Вставка
- Опубліковано 2 гру 2017
- Download LMT APP Now One Stop Solution for Engineering and Placement
LMT APP Link : play.google.com/store/apps/de...
Get Video Lectures , Module wise Importance with Solution , Viva Questions , PYQ and How to Pass Strategy. [ Download our App Now ]
Offline mode:-You can access everything offline ( Without Internet ) ✅
Connect with Me on Linkedin : / sumersingh-rajpurohit
Join LMT Telegram Community for Daily Job Updates : t.me/LMTPlacements
__________________________________________________________________________________________
Join LMT Social Media to Stay Updated with academics and get Importance and resources of other subjects of Engineering
WhatsApp Community Link:- chat.whatsapp.com/J4GvAzEV8sS...
Instagram Page:- / lastmomenttuition
Telegram Community : t.me/lastmomenttuitions
Daily Job Updates : t.me/LMTPlacements
___________________________________________________________________________________________
Tags :
Expert system in Artificial intelligence in hindi ,
Min Max algorithm with sovle example in hindi | Artificial Intelligence series
Breadth first search with solved example in Hindi | Artifical intelligence series
Artificial Intelligence Video Lectures ,
Artificial Intelligence tutorials ,
Agent and PEAS Description ,
Hashtags :
#LMT #lastmomenttuitions #Engineering #Placements
#Artificialintelligence #PEAS
You are one of the most talented man in the world who understand the critical concept in very easy way thanks bro😊
Thanks bhai pata nai tha hum log k sath tu bhi mehnat kar rha h salute h bhai tuje
Amazing video! Referred to so many tutorials but no one explained it with such ease as you did! Remarkable! Thanks a lot!!
you are awesome bro. You simplify the whole concept and make the topic easy to understand. You are the Lifesaver.
You are just awesome man! carry on the good work and simplicity. Lots of love and appreciation from Nepal. It really was helpful.
Thanks a lot just called you for this ... Hope your channel grows . Atb
bohot hard bhai mast samjha dekhke jo mera professor 1 mahine se nahi samjha paya kudos man Keep it up 👌👌👌👌👌👌
awesome lecture with posstive energy 👍🏻
Thank you so much for all the help.
Please upload a video on Bayesian Network and Conditional Probability and Forward and Backward Chaining if possible.
It will be very helpful thank you so much!
Thanks for taking so many efforts :)
Thank you so much sumair it really helped me alot
Great explaining skill and communication fabulous
At the place where you are replacing and saying contradict hoga,that process is called unification.
And when we replace x by w,we write the unifier as w/x.
Thanks a lot bro, after watching this all concepts are clear.
Thanks once again
This was so quick and easy to understand. Saved me in the last moment🔥
Thanks
Thanks a lot Sumer Bhai U r like a SAVIOUR for us Aap hamare liye FARISHTA ho 😘😘😘😘😘😘😘
Thankyou so much ,please make videos now in 2024 cause you explain the concept like no one else can👍
Bro excellent effort from your side and according to me you have a strong subject knowledge but you explain the example which is mostly discussed by others no doubt you are a good teacher but try to discussed different example which was not explain already or create yourself .Thanku
Regard:
Usman Bashir
Thank u sir for giveing a conceptual knowledge
Awesome Work! Thanks alot.
Best thing about this video !! Hamara professor bhi yahi se padhta hai !
Thanks alot sir...it really helped me...your teaching skills are amazing.,.
thanks aahil acha laga toh share kardo
Sir you are the best!
tomorrow is my exam and this vedio is really became my saviour ..a true last moment tuitions
Brilliant Explanation Sir
Thanku so much sir..... Really I salute you
Dil Jeet liya mere bhai tune toh tysm 👍👍👍👍 Please ek Bayesian pe video banao
thnx...for ur valuable efforts....
Thanks lots😊.. Can you please make a video on EM algorithm in machine learning.
I'm having final sem 7 exam today and I'm just here an hour before exam...and this video was so great t.. thankyou so much 🌟🌟
Can you upload vedio on how to draw sementic network from sentence
really helpful thanks a lot
Video on Bayesian network and conditional probability.
At the step of "move negation inward" you have taken "All" symbol
And we have to prove for "Someone is smiling"
So in the step of skolemization
We will remove "some"
I was going to skip this part for my endsem... Thanks 🙌
you r really great buddy.
thank you bro. you are really awesome..
very good video and explanation
Fabulous explanation
Thanks a lot.❤️
Video badiaa thi...and most importantly your MUMBAIA Accent ... Apne ko to bohot badiaa laga Kya baaap...
Thank you bhai, kadak explaination
Welcome
sr g owesom...bndls of thnkx.
Good explanation 💯
Thank you so much ❤️👏
Awsome 👍🏻👍🏻👍🏻
Thank you !
Mere paas apke tareef k liye words nhi ha very well done bro
Thank you so much bhaiya
Thanks a lot for this
Thank you so muchhhhhh🎉🎉
best best best awesome
bhht sary videos dekhy lakin ye video hi bus samajh aye hay
Thank you so much
Big thanks sir.love u
awesome bhai...........
Thnx bhai❤
Thank you soo much sir😊
Although I already knew the concept still I feel it was worth watching, very well explained, keep the good work going!!
Thankyou!!
Good way of explaining
Thanks and welcome
Amazing video sir👍
Thanks
Resolution Tree concept and construction - 9:18
Thanks dada...
can you put up a video on inductive learning?
Thanks for tutorial ❤️❤️
Welcome
Vedio on constraint satisfaction problem
Thanks bhai
thanks
Best Explanation 👍
Thanks
ty bhai !!
kya legend ho bhaiiii
Amazing
Thank you bhai 👌🏻👌🏻
Welcome
Perfect broo perfect
Love you brother
💯 💯 Well explained
thanks
bhai bhai , bhai bhai
majja aagaya!!
Nice one bro!!!
Thanks
Belief networks ka last video daal de bro
All hounds howl at night.
Anyone who has any cats will not have any mice.
Light sleepers do not have anything which howls at night.
John has either a cat or a hound.
its resolution is tough
Thanks a Million 👏👏
Welcome
nice bro
Nice👏
Knowledge base KB ka video upload karo please
Sir ji Please aur videos AI KI upload kariye
Bro please make a video for this problem.........
The following facts and represent them in predicate form:
i. There are 500 employees in ABC company.
ii. Employee earning more than Rs. 5000 pay tax.
iii. John is a manager in ABC company.
iv. Manager earns Rs. 10,000. Convert the facts in predicate form to clauses and then prove by resolution: "John pays tax”.
Bro,I have a doubt.
if we start with (-)happy and find happy they cancel each other bt what if we dont have happy in cnf bt instead have (-)happy.
Will they cancel out each other too?
ek number
Thank you so much ..
most welcome do share it
☺️☺️☺️☺️
Bhai bacha liya tumne exams mai. Thank you !!
what if there were more than one smile at 10:55.which one wud be choosen?
13:40 resolution tree
13:43 i am happy😊😊😊😊
❤
✌✌👌
Best bhai.. prso hi h exam👻
Abe lssn aadmi tujhse pucha kisine!!
Fol to cnf k first video part me
Move negation inward me univesal quantifier ko existential me convert kr diye ho lekin
Resolution tree Wale part 2 me
Fol to cnf me univesal quantifier ko existential me convert nahi kiye ho .......????
😊👍👍👍👍
👍👍👍💯💯💯
superbbbbbbbbbbb
Please make those private videos available 🙏🙏
it available on the website check the description