Verification of the Completeness of Unification Algorithms à la Robinson [chapter]

Andréia B. Avelar, Flávio L. C. de Moura, André Luiz Galdino, Mauricio Ayala-Rincón
2010 Lecture Notes in Computer Science  
This work presents a general methodology for verification of the completeness of firstorder unification algorithmsà la Robinson developed in the higher-order proof assistant PVS. The methodology is based on a previously developed formalization of the theorem of existence of most general unifiers for unifiable terms over first-order signatures. Termination and soundness proofs of any unification algorithm are proved by reusing the formalization of this theorem and completeness should be proved
more » ... cording to the specific way in that non unifiable inputs are treated by the algorithm.
doi:10.1007/978-3-642-13824-9_10 fatcat:ne54gywxnre4jpqld5mosc5fkm