Buscar
Mostrando ítems 11-12 de 12
Artículo
Efficient execution in an automated reasoning environment
(Cambridge University Press, 2008)
We describe a method that permits the user of a mechanized mathematical logic to write elegant logical definitions while allowing sound and efficient execution. In particular, the features supporting this method allow ...
Ponencia
A Formal Proof of Dickson’s Lemma in ACL2
(Springer, 2003)
Dickson’s Lemma is the main result needed to prove the termination of Buchberger’s algorithm for computing Gr¨obner basis of polynomial ideals. In this case study, we present a formal proof of Dickson’s Lemma using the ...