{"paper":{"title":"A Formalization of the Theorem of Existence of First-Order Most General Unifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andr\\'eia B Avelar (Universidade de Bras\\'ilia), Andr\\'e L Galdino (Universidade Federal de Goi\\'as), Fl\\'avio LC de Moura (Universidade de Bras\\'ilia), Mauricio Ayala-Rinc\\'on (Universidade de Bras\\'ilia)","submitted_at":"2012-03-28T05:06:30Z","abstract_excerpt":"This work presents a formalization of the theorem of existence of  most general unifiers in first-order signatures in the higher-order  proof assistant PVS. The distinguishing feature of this  formalization is that it remains close to the textbook proofs that  are based on proving the correctness of the well-known Robinson's first-order unification algorithm. The formalization was applied  inside a PVS development for term rewriting systems that provides a  complete formalization of the Knuth-Bendix Critical Pair theorem,  among other relevant theorems of the theory of rewriting. In  addition,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6160","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}