Advertisement

A Content Based Mathematical Search Engine: Whelp

  • Andrea Asperti
  • Ferruccio Guidi
  • Claudio Sacerdoti Coen
  • Enrico Tassi
  • Stefano Zacchiroli
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3839)

Abstract

The prototype of a content based search engine for mathematical knowledge supporting a small set of queries requiring matching and/or typing operations is described. The prototype — called Whelp — exploits a metadata approach for indexing the information that looks far more flexible than traditional indexing techniques for structured expressions like substitution, discrimination, or context trees. The prototype has been instantiated to the standard library of the Coq proof assistant extended with many user contributions.

Keywords

Indexing Technique Ambiguous Term Context Tree Metadata Model Literal Symbol 
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., Guidi, F., Padovani, L., Sacerdoti Coen, C., Schena, I.: The Science of Equality: some statistical considerations on the Coq library. In: Mathematical Knowledge Management Symposium, Heriot-Watt University, Edinburgh, Scotland, November 25-29 (2003)Google Scholar
  2. 2.
    Asperti, A., Guidi, F., Padovani, L., Sacerdoti Coen, C., Schena, I.: Mathematical Knowledge Management in HELM. Annals of Mathematics and Artificial Intelligence 38(1), 27–46 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Asperti, A., Selmi, M.: Efficient Retrieval of Mathematical Statements. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol. 3119, pp. 17–31. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Asperti, A., Wegner, B.: An Approach to Machine-Understandable Representation of the Mathematical Information in Digital Documents. In: Bai, F., Wegner, B. (eds.) ICM 2002. LNCS, vol. 2730, pp. 14–23. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    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
  6. 6.
    Bancerek, G., Urban, J.: Integrated Semantic Browsing of the Mizar Mathematical Repository. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol. 3119, pp. 44–57. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Cairns, P.: Informalising Formal Mathematics: Searching the Mizar Library with Latent Semantics. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol. 3119, pp. 58–72. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    The Coq proof-assistant, http://coq.inria.fr
  9. 9.
    Cruz-Filipe, L., Geuvers, H., Wiedijk, F.: C-CoRN, the Constructive Coq Repository at Nijmegen. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol. 3119, pp. 88–103. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    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, pp. 131–147. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  11. 11.
    Di Cosmo, R.: Isomorphisms of Types: from Lambda Calculus to Information Retrieval and Language Design. Birkhauser, Basel (1995) IBSN-0-8176-3763-XzbMATHGoogle Scholar
  12. 12.
    Ganzinger, H., Nieuwehuis, R., Nivela, P.: Fast Term Indexing with Coded Context Trees. Journal of Automated Reasoning (to appear)Google Scholar
  13. 13.
    Graf, P.: Substitution Tree Indexing. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol. 914, pp. 117–131. Springer, Heidelberg (1995)Google Scholar
  14. 14.
    Guidi, F., Sacerdoti Coen, C.: Querying Distributed Digital Libraries of Mathematics. In: Proceedings of Calculemus 2003, 11th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Aracne Editrice (2003)Google Scholar
  15. 15.
    McBride, C.: Dependently Typed Functional Programs and their Proofs. Ph.D. thesis, University of Edinburgh (1999)Google Scholar
  16. 16.
    McCune, W.: Experiments with discrimination tree indexing and path indexing for term retrieval. Journal of Automated Reasoning 9(2), 147–167 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Munoz, C.: A Calculus of Substitutions for Incomplete-Proof Representation in Type Theory. Ph.D. thesis, INRIA (1997)Google Scholar
  18. 18.
    Sacerdoti Coen, C.: From Proof-Assistans to Distributed Libraries of Mathematics: Tips and Pitfalls. In: Asperti, A., Buchberger, B., Davenport, J.H. (eds.) MKM 2003. LNCS, vol. 2594, pp. 30–44. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  19. 19.
    Sacerdoti Coen, C., Zacchiroli, S.: Efficient Ambiguous Parsing of Mathematical Formulae. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol. 3119, pp. 347–362. Springer, Heidelberg (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Andrea Asperti
    • 1
  • Ferruccio Guidi
    • 1
  • Claudio Sacerdoti Coen
    • 1
  • Enrico Tassi
    • 1
  • Stefano Zacchiroli
    • 1
  1. 1.Department of Computer ScienceUniversity of BolognaBolognaItaly

Personalised recommendations