Reading: AIAMA 9.1-9.2
Now that we can define FOL knowledge-bases we need to be able to do inference. An important step in this process is the ability to parse and match two FOL expressions using the unification algorithm.
Questions you should be able to answer after reading are:
Focus on the unification algorithm in Fig 9.1 You should also be able to trace its execution for example inputs.