Modal formulas can be proved by translating them into a three-typed logic and then using unification and resolution, with axioms describing properties of the reachability relation among possible worlds. In this paper, we improve on the algorithms in [1], showing that strong skolemisation and occurrence checks are not needed for proving theorems of Q, T, Q4, and S4. We also extend the \u27path logic\u27 approach to S5, give the appropriate unification algorithm, and prove its correctness
