Mathematical Knowledge Management in HELM
Annals of Mathematics and Artificial Intelligence
Packaging Mathematical Structures
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Constructive type classes in Isabelle
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Evaluation of automated theorem proving on the Mizar mathematical library
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Sine Qua non for large theory reasoning
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Automated and human proofs in general mathematics: an initial comparison
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Eliciting Implicit Assumptions of Mizar Proofs by Property Omission
Journal of Automated Reasoning
Premise Selection for Mathematics by Corpus Analysis and Kernel Methods
Journal of Automated Reasoning
Hi-index | 0.00 |
Two methods for extracting detailed formal dependencies from the Coq and Mizar system are presented and compared. The methods are used for dependency extraction from two large mathematical repositories: the Coq Repository at Nijmegen and the Mizar Mathematical Library. Several applications of the detailed dependency analysis are described and proposed. Motivated by the different applications, we discuss the various kinds of dependencies that we are interested in, and the suitability of various dependency extraction methods.