14.14 Notes and Further Reading

A detailed treatment of the steps necessary to convert a wff in predicate calculus into clausal form can be found in Rich, Knight, and Nair (2009, Section 5.4.1). The unification algorithm used during resolution, which rendered logic programming practical, was developed by John Alan Robinson (1965). For a detailed outline of the steps of the unification algorithm, we direct readers to Rich, Knight, and Nair (2009, Section 5.4.4). For a succinct introduction to Prolog, we refer readers to Pereira (1993). The Watson question-answering system from IBM was developed in part in Prolog. Some parts of this chapter, particularly Section 14.10, appear in Watkin, Volk, and Perugini (2019).