Abstract

The heterogeneous nature of the logical foundations used in different interactive proof assistant libraries has rendered discovery of similar mathematical concepts among them difficult. In this paper, we compare a previously proposed algorithm for matching concepts across libraries with our unsupervised embedding approach that can help us retrieve similar concepts. Our approach is based on the fasttext implementation of Word2Vec, on top of which a tree traversal module is added to adapt its algorithm to the representation format of our data export pipeline. We compare the explainability, customizability, and online-servability of the approaches and argue that the neural embedding approach has more potential to be integrated into an interactive proof assistant.

BibTeX

@inproceedings{qwck-frocos21,
  author       = {Qingxiang Wang and Cezary Kaliszyk},
  editor       = {Boris Konev and Giles Reger},
  title        = {{JEFL:} {J}oint Embedding of Formal Proof Libraries},
  booktitle    = {Frontiers of Combining Systems - 13th International Symposium, FroCoS 2021},
  series       = {LNCS},
  volume       = {12941},
  pages        = {154--170},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-86205-3\_9},
  doi          = {10.1007/978-3-030-86205-3\_9},
}