Скачать с ютуб Unification-Artificial Intelligence-Logical Reasoning-Unit – 2-15A05606 в хорошем качестве

Unification-Artificial Intelligence-Logical Reasoning-Unit – 2-15A05606

Unit – 2 – Logical Reasoning Unification Unification is an algorithm for determining the substitutions needed to make two FOL (predicate calculus) expressions match. To apply the rules of inference, an inference system must be able to determine when two expressions match, here the unification algorithms used. The UNIFY algorithm is used for unification, which takes two atomic sentences and returns a unifier for those sentences (If any exist). Example: Find the MGU for Unify{King(x), King(John)} Let α1 = King(x), α2 = King(John), Substitution θ = {John/x} is a unifier for these atoms and applying this substitution, and both expressions will be identical. We can get the inference immediately, if we can find a substitution θ such that King(x) and Greedy(x) match King(John) and Greedy(y) θ = {x/John, y/John} works Unify(α,β) = θ if αθ = βθ p q θ Knows(John,x) Knows(John,Jane) {x/Jane}} Knows(John,x) Knows(y,Jack) {x/Jack,y/John}} Knows(John,x) Knows(y,Mother(y)) {y/John,x/Mother(John)}} Knows(John,x) Knows(x,Jack) {fail} Subscribe this channel, comment and share with your friends. For Syllabus, Text Books, Materials and Previous University Question Papers and important questions Follow me on Blog : https://dsumathi.blogspot.com/ Facebook Page : https://www.facebook.com/profile.php?... Instagram :   / dsumathiphd