It's amazing! After two days passed reading book and searching on the internet for a good and simple explanation i finally understood thank to you. Thank you so much!
Could someone comment as to how the provided pseudocode would change if applying to a first order logic knowledge base in CNF form? When do we apply the unification?
To prove alpha was it enough to resolute P1,2 with !P1,2 ? Or do we have to resolute everything in the sentence? If yes, what if we have unnecessary rules in the KB. Then do we have to resolute everything, again. Thanks in advance
@@derekdj6790 I think he is referring to how most of the people who attempt to teach this subject are bad while this channel is better than those mediocre teachers. And I agree that is sad
Hi, great video. Just wanted to clarify something. I noticed that you did not resolve the query, P(1,2) with the sentence, not P(1,2) or B(1,1) why is this the case? Is it that you only resolve the query with the second row of sentences?
Right, so once you resolve whatever can be resolved on the first row, you generate the second row. Then you resolve the second row and whatever expressions were left unresolved from the first row (those that never resolve with anything)
It's amazing! After two days passed reading book and searching on the internet for a good and simple explanation i finally understood thank to you.
Thank you so much!
This is the best explanation on the internet! Would be great if you could teach my grad classes
Thank you so much! This explanation is much more intuitive and easy to understand than the one given in the university I study in.
ok
very clear, much better than what I learn from the lecture.
I have been searching for this concept for more than an hour and finally got the best video thank you soo much 🙂
Amazing man well done keep it up
Thank you very much! Your videos are very coherent and helpful
Thank you so much! Better than my professor's explanation.
Thank you dear sir, you helped me alot.
thank you for using russell and norvig
Why do we stop at -P1,2? Do we stop at the first clause generated that does(n't) negate the alpha?
Thank you so so much!!
Thank you so much!
Thank you so much
it's not affecting the final result but (P12 OR P21 OR NOT(P12)) should be (P12 OR P21 OR NOT(P21)).
Could someone comment as to how the provided pseudocode would change if applying to a first order logic knowledge base in CNF form? When do we apply the unification?
Can we use and elimination during resolution?
To prove alpha was it enough to resolute P1,2 with !P1,2 ? Or do we have to resolute everything in the sentence? If yes, what if we have unnecessary rules in the KB. Then do we have to resolute everything, again.
Thanks in advance
It is sad that this is the best video I have found. Why is this subject the hardest thing to teach people? I guess those who can do, can't teach.
I disagree about this being sad, I think he explains it very well. The only video that I needed
Sad. Huh. He is good.
@@derekdj6790 I think he is referring to how most of the people who attempt to teach this subject are bad while this channel is better than those mediocre teachers. And I agree that is sad
Can you please share this presentation!
Character In the video It's great, I like it a lot $$
Hi, great video. Just wanted to clarify something. I noticed that you did not resolve the query, P(1,2) with the sentence, not P(1,2) or B(1,1) why is this the case? Is it that you only resolve the query with the second row of sentences?
Right, so once you resolve whatever can be resolved on the first row, you generate the second row. Then you resolve the second row and whatever expressions were left unresolved from the first row (those that never resolve with anything)
+Francisco Iacobelli but it should try to resolve with each sentence in the first row.
Also it will continue until i produce the opposite?
So if you can't get the empty clause, it means the original conjecture KB |= a is false?
Right, if you can't get a empty clause, it means the negation satisfiable, see also Davis-Putnam algorithm.
"Satisfiable" is key, because it reflects that we are talking about all models, not just one, when asking if something is entailed.
the p2,1 and p1,2 are missprinted @9:06
also@10:24
can you elaborate more on that? What is the exact mistake that he did?
i replayed that part at least 10 times thinking i was missing something, came to the commment section just for this, ty
Thank you, i've been staring at the figure for 15 min, wondering why it was like that.
good
coma means AND or OR? or i doesnt matter ? i thought if it was above was an AND and coma was an OR
why we took only R1 and R4 as knowledge base?...why not all the rules??
The Knowledge Base is whatever the agent knows about, which is not likely to be every possible rule.
CS 383 rip
RIP ALREADY
Making it too complicated...