A formal proof of Dickson's Lemma in ACL2

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2850, Issue , 2003, Pages 49-58

  Martin Mateos F J ^a   Alonso, J A ^a   Hidalgo, M J ^a   Ruiz Reina, J L ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; FUNCTIONS; POLYNOMIALS; SET THEORY;

CONSTRUCTIVE PROOF; FORMAL PROOFS; MULTISET EXTENSION; S-ALGORITHMS; TERMINATION ARGUMENTS;

COMPUTATION THEORY; THEOREM PROVING;

DICKSON'S LEMMA; FORMALIZATION; INSTANTIATION; NEWMAN'S LEMMA;

EID: 9444282733     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39813-4_3     Document Type: Conference Paper

References (16)

1. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
2. T. Becker and V. Weispfenning. Gröbner Bases: A Computational Approach to Commutative Algebra. Springer-Verlag, 1998.
3. U. Berger, H. Schwichtenberg and M. Seisenberger. The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program Extraction. Journal of Automated Reasoning 26: 205-221, 2001.
4. T. Coquand and H. Persson. Gröbner Bases in Type Theory. In Types for Proofs and Programs: Selected papers of TYPES'98, LNCS 1657, pages 33-46. Springer-Verlag, 1999.
5. N. Dershowitz and Z. Manna. Proving Termination with Multiset Orderings. Communications of the ACM 22(8):465-476, 1979.
6. M. Kaufmann, P. Manolios, and J S. Moore. Computer-Aided Reasoning: An Approach. Kluwer Academic Publishers, 2000.
7. M. Kaufmann and J S. Moore. ACL2 Version 2.7, 2001. Homepage: http://www.cs.utexas.edu/users/moore/acl2/
8. G. Lee and P. Rudnicki. Dickson's Lemma. Journal of Formalized Mathematics 14, 2002.
9. I. Medina-Bulo, J.A. Alonso, F. Palomo. Polynomial algorithms in ACL2 (an approach to Buchberger algorithm). In I Taller Iberoamericano sobre Deducción Automática e Inteligencia Artificial, IDEIA 2002 (in spanish), 2002. Available at http://www.cs.us.es/ideia.
10. H. Perdry. Strong noetherianity: a new constructive proof of Hilbert's basis theorem. Available at http://perdry.free.fr/StrongNoetherianity.ps
11. H. Persson. An Integrated Development of Buchberger's Algorithm in Coq. Rapport de recherche de l'INRIA, n 4271, 2001.
12. L. Pottier. Dixon's lemma, 1996. Available at ftp://ftp-sop.inria.fr/lemme/Loic.Pottier/MON/
13. J.L. Ruiz-Reina, J.A. Alonso, M.J. Hidalgo, and F.J. Martín. Multiset Relations: a Tool for Proving Termination. In Second ACL2 Workshop, Technical Report TR-00-29, Computer Science Departament, University of Texas, 2000. Available at http://www.cs.utexas.edu/users/moore/acl2/workshop-2000/
14. S.G. Simpson. Ordinal numbers and the Hilbert basis theorem. Journal of Symbolic Logic 53(3): 961-974, 1988.
15. M. Sustyk. Proof of Dickson's Lemma Using the ACL2 Theorem Prover via an Explicit Ordinal Mapping. In Fourth ACL2 Workshop, 2003. Available at http://www.cs.utexas.edu/users/moore/acl2/workshop-2003/
16. L. Théry. A Machine-Checked Implementation of Buchberger's Algorithm. Journal of Automated Reasoning 26(2): 107-137, 2001.