Видео

Really nice

Mam can you share PPT

Thank you, you're the best❤

Truth table??

Thank you mam ❤, you have covered all possible examples.

Thank you man 😊

Excellent ❤❤

Thank you from Nepal

simply the best

thankyou mam best video on ao* i found on youtube . well explained

how can we download this ppt?

Very good example mam and well explained, thanks

Thanks Madam, 3 years into the future after you posted this video. It helped me prepare for exam. Bow to you 🙏

very Good material mam too good

mam can u share the ppt.. in a drive..

0:30 Resolution Definition 2:03 Steps 2:53 Example #1 7:15 Example #2 12:40 Example #3

how u know that u have to use what additional predicte ? raata mar ke aayeho??

Very simple indeed ma’am

Very Useful Explanation Mam

Thank you so much. Well explained ❤

Nice Explained maam thank you

Good

great lesson thank you

Thank you.... ❤

Thank you so much ma'am your videos helped me alot🙏

Can anyone please help. When do we add extra predicates?

Thanks for your examples. I'm confused about the computability of this; certainly you're not suggesting manual processing on paper? What software is there in which these can be attempted? I've learned a little of Prolog that does predicate logic. It allows uppercase starting letters only for variables. So the example Man(Mihir) @3:38 is entered man(mihir). I'm not sure Prolog accepts other operators like or, not, gt etc.. And how can the quantifier symbols (upside down A and backwards E) be enterd on a keyboard? If this is to processed in a computer, do I have to make my own symbols?

What is the time complexity of AO* algorithm mam?

Well explained Mam 👏🏻

Thank you very much! Good and clear explanation.

Hi mam Could you please share the ppt

thank you

excellent explanation madam. thank you

Mam exam main theory ke sath example bhi likhana chahiy ...... ya nhi

Mam thank you so much for your videos on this topic ... You made my concepts crystal clear ... I have a question tho ... In previous video u showed us 8 steps to convert in to prenix normal form ... But why r u only applying 5 steps in each example... Why haven't u applied scolemization , removing of universal quantifies and conjunction of disjunction?

Thank you so much....from Palestine

You made it very simple mam...Thank You so much..

1) Convert Sentences into FOL ( First Order Logic) 2) FOL into CNF ( Conjuctive Normal Form ) - here we eliminate impication 3) Resolution Graph

Thanks mam.... excellent

thank you mam

Nice explanation Madam

Thank you very much for your lesson!!

Mam pls explain the optimal binary search tree

D to h not taken

Excellent work

Mam I have a doubt if there is a their exists symbol what will we do

Thank you mam😊😊😊

It was really a good video

love it, thanks for the explanation

Mam...how to add extra predicates