Advertisement

Efficient Retrieval of Mathematical Statements

  • Andrea Asperti
  • Matteo Selmi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3119)

Abstract

The paper describes an innovative technique for efficient retrieval of mathematical statements from large repositories, developing and substantially improving the metadata-based approach introduced in [10].

Keywords

Mathematical Statement Automate Reasoning Substitution Tree Account Subset Discrimination Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Asperti, A., Goguadze, G., Melis, E.: Structure and meta-structure of mathematical documents, Deliverable D1b of Project IST-2001-33562 MoWGLI, http://www.mowgli.cs.unibo.it/
  2. 2.
    Bancerek, G., Rudnicki, P.: Information retrieval in MML. In: Asperti, A., Buchberger, B., Davenport, J.H. (eds.) MKM 2003. LNCS, vol. 2594, pp. 119–132. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  3. 3.
    Christian, J.: Flatterms, discrimination nets and fast term rewriting. Journal of Automated Reasoning 10, 95–113 (1993)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Delahaye, D., Di Cosmo, R.: Information retrieval in a Coq proof library using type isomorphisms. In: Coquand, T., Nordström, B., Dybjer, P., Smith, J. (eds.) TYPES 1999. LNCS, vol. 1956. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Di Cosmo, R.: Isomorphisms of Types: from Lambda Calculus to Information Retrieval and Language Design. Birkhäuser, Basel (1995)CrossRefzbMATHGoogle Scholar
  6. 6.
    Ganzinger, H., Nieuwehuis, R., Nivela, P.: Fast term indexing with coded context trees. Journal of Automated Reasoning (to appear)Google Scholar
  7. 7.
    Goguadze, G.: Metadata for mathematical libraries, Deliverable D3a of Project IST-2001-33562 MoWGLI, http://www.mowgli.cs.unibo.it/
  8. 8.
    Graf, P.: Substitution tree indexing. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol. 914, pp. 117–131. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  9. 9.
    Guidi, F.: Searching and retrieving in content-based repositories of formal mathematical knowledge, Ph.D. Thesis in Computer Science, Technical Report UBLCS 2003-06. University of Bologna (March 2003)Google Scholar
  10. 10.
    Guidi, F., Sacerdoti Coen, C.: Querying distributed digital libraries of mathematics. In: Aracne Editrice, S.R.L., Hardin, T., Rioboo, R. (eds.) Calculemus 2003, pp. 17–30 (2003) ISBN 88-7999-545-6Google Scholar
  11. 11.
    Guidi, F., Schena, I.: A query language for a metadata framework about mathematical resources. In: Asperti, A., Buchberger, B., Davenport, J.H. (eds.) MKM 2003. LNCS, vol. 2594, pp. 105–118. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  12. 12.
    Kohlhase, M., Franke, A.: MBase: representing knowledge and context for the integration of mathematical software systems. Journal of Symbolic Computation 23(4), 365–402 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Mathematical Markup Language (MathML) Version 2.0, W3C Recommendation (February 21, 2001), http://www.w3.org/TR/MathML2
  14. 14.
    McCune, W.: Experiments with discrimination tree indexing and path indexing for term retrieval. Journal of Automated Reasoning 9(2), 147–167 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    OMDOC: A Standard for Open Mathematical Documents, http://www.mathweb.org/omdoc/omdoc.ps
  16. 16.
  17. 17.
    Schena, I.: Towards a Semantic Web for Formal Mathematics, Ph.D. Dissertation, Department of Computer Science. University of Bologna, Italy (January 2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Andrea Asperti
    • 1
  • Matteo Selmi
    • 1
  1. 1.Department of Computer ScienceBolognaItaly

Personalised recommendations