Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

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

Summary: A Formalization of the Theorem of Existence of First-Order Most
General Unifiers
Andr´eia B. Avelar1, Fl´avio L. C. de Moura2
Mauricio Ayala Rinc´on1,2
Departamentos de 1Matem´atica e 2Ci^encia da Computac¸~ao
Universidade de Bras´ilia
Bras´ilia, Brazil
andreia@mat.unb.br,flavio@cic.unb.br,ayala@unb.br
Andr´e Luiz Galdino
Departamento de Matem´atica
Universidade Federal de Goi´as
Catal~ao, Brazil
galdino@unb.br
Abstract
This work presents a formalization of the theorem of existence of most general unifiers in first-
order signatures on the higher-order proof assistant PVS. The proof is close to the textbook proofs that
are based on proving the correctness of the well-known Robinson's first-order unification algorithm
and it was applied inside a complete PVS development for term rewriting systems that provides a
complete formalization of the Knuth-Bendix Critical Pair theorem. The formalization methodology
can be directly applied to verify unification algorithms in the style of the original Robinson's one as

  

Source: Ayala-Rincón, Mauricio - Departamento de Matemática, Universidade de Brasília

 

Collections: Mathematics