A Formalization of the Theorem of Existence of First-Order Most General Unifiers

  title={A Formalization of the Theorem of Existence of First-Order Most General Unifiers},
  author={Andr{\'e}ia B. Avelar and Andr{\'e} Luiz Galdino and Fl{\'a}vio L. C. de Moura and Mauricio Ayala-Rinc{\'o}n},
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… 
2 Citations

Figures from this paper

Iwc 2013 2nd International Workshop on Confluence Program Committee Three Termination Problems Confluence and Infinity -a Kaleidoscopic View Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering (extended Abstract)
s of Invited Talks Three Termination Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Patrick Dehornoy Confluence and Infinity a kaleidoscopic view .
Synchronizing Applications of the Parallel Moves Lemma To Formalize Conuence of Orthogonal TRSs in PVS
A complete formalization in PVS of the theorem of confluence of orthogonal term rewriting systems is presented, using the PVS theory maintaining its distinguishing feature of remaining close to textbook’s proofs.


Verification of the Completeness of Unification Algorithms à la Robinson
This work presents a general methodology for verification of the completeness of first-order unification algorithms a la Robinson developed in the higher-order proof assistant PVS. The methodology is
Verifying the Unification Algorithm in LCF
A Formalization of Newman's and Yokouchi's Lemmas in a Higher-Order Language
This paper shows how a formalization for the theory of Abstract Reduction Systems (ARSs) in which noetherianity was specified by the notion of well-foundness over binary relations is used in order to
A Formalization of the Knuth–Bendix(–Huet) Critical Pair Theorem
A mechanical proof of the Knuth–Bendix Critical Pair Theorem in the higher-order language of the theorem prover PVS is described and follows Huet’s well-known structure of proof in which the restriction on strong normalization or Noetherian was dropped and the result presented as a lemma.
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates
This paper presents a library formalising important results of the theory of well-founded (rewrite) relations in the proof assistant Coq, and presents its application to the automated verification of termination certificates, as produced by termination tools.
A Machine-Oriented Logic Based on the Resolution Principle
The paper concludes with a discussion of several principles which are applicable to the design of efficient proof-procedures employing resolution as the basle logical process.
Programming in Martin-Löf Type Theory: Unification - A non-trivial Example
The main feature of the methodology presented here is the introduction of an inductive predicate, specially for the uni cation algorithm, that can be thought of as the set of lists of pairs of terms for which the algorithm terminates.
Formal Correctness of a Quadratic Unification Algorithm
A case study using ACL2 to verify a nontrivial algorithm that uses efficient data structures that stores terms as directed acyclic graphs by means of a pointer structure.
A PVS Theory for Term Rewriting Systems
Foundations of Logic Programming
  • J. Lloyd
  • Computer Science
    Symbolic Computation
  • 1987
This is the second edition of an account of the mathematical foundations of logic programming. Its purpose is to collect, in a unified and comprehensive manner, the basic theoretical results of the