Context aware calculation and deduction ring equalities via gröbner bases in Isabelle

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4573 LNAI, Issue , 2007, Pages 27-39

  Chaieb, Amine ^a   Wenzel, Makarius ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; FORMAL LOGIC; THEOREM PROVING;

ABSTRACT THEORY CONTEXTS; DEDUCTION RINGS; EXTRA LOGICAL CONTENT UNIFORMLY;

CALCULATIONS;

EID: 38049033322     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (20)

1. Ballarin, C.: Locales and locale expressions in Isabelle/Isar. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol. 3085, Springer, Heidelberg (2004)
2. Ballarin, C.: Interpretation of locales in Isabelle: Theories and proof contexts. In: Borwein, J.M., Farmer, W.M. (eds.) MKM 2006. LNCS (LNAI), vol. 4108, Springer, Heidelberg (2006)
3. Barras, B., et al.: The Coq Proof Assistant Reference Manual. INRIA, vol. 8 (2006)
4. Buchberger, B.: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems. Aequationes mathematicae 3, 374-383 (1970)
5. Chaieb, A.: Verifying mixed real-integer quantifier elimination. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, Springer, Heidelberg (2006)
6. Chaieb, A., Nipkow, T.: Verifying and reflecting quantifier elimination for Presburger arithmetic. In: Stutcliffe, G., Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning, vol. 3835 (2005)
7. Delahaye, D., Mayero, M.: Dealing with Algebraic Expressions over a Field in Coq using Maple. In: Journal of Symbolic Computation: special issue on the integration of automated reasoning and computer algebra systems (2004)
8. Delahaye, D., Mayero, M.: Quantifier Elimination over Algebraically Closed Fields in a Proof Assistant using a Computer Algebra System. In: Proceedings of Calculemus 2005 (2005)
9. Farmer, W.M., Guttman, J.D., Thayer, F.J.: IMPS: An interactive mathematical proof system. Journal of Automated Reasoning, 11(2) (1993)
10. Gordon, M.J.C, Milner, R., Wadsworth, C.P.: Edinburgh LCF. LNCS, vol. 78. Springer, Heidelberg (1979)
11. Grégoire, B., Mahboubi, A.: Proving equalities in a commutative ring done right in Coq. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol. 3603, Springer, Heidelberg (2005)
12. Haftmann, F., Wenzel, M.: Constructive type classes in Isabelle. In: Altenkirch, T., McBride, C. (eds.) Types for Proofs and Programs (TYPES 2006)
13. Harrison, J.: HOL Light Tutorial (for version 2.20) (September 2006)
14. Harrison, J., Théry, L.: A skeptic's approach to combining HOL and Maple. Journal of Automated Reasoning 21, 279-294 (1998)
15. Kammüller, F., Wenzel, M., Paulson, L.C.: Locales: A sectioning concept for Isabelle. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Théry, L. (eds.) TPHOLs 1999. LNCS, vol. 1690, Springer, Heidelberg (1999)
16. Mishra, B.: Algorithmic algebra. Springer, Heidelberg (1993)
17. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
18. Paulson, L.C.: Organizing numerical theories using axiomatic type classes. Journal of Automated Reasoning, 33(1) (2004)
19. Wenzel, M.: Type classes and overloading in higher-order logic. In: Gunter, E.L., Felty, A.P. (eds.) TPHOLs 1997. LNCS, vol. 1275, Springer, Heidelberg (1997)
20. Wenzel, M.: Isabelle/Isar -a versatile environment for human-readable formal proof documents. PhD thesis, Institut für Informatik, TU München (2002)