Skip to main content

Spurious Disambiguation Error Detection

  • Conference paper
Towards Mechanized Mathematical Assistants (MKM 2007, Calculemus 2007)

Abstract

The disambiguation approach to the input of formulae enables the user to type correct formulae in a terse syntax close to the usual ambiguous mathematical notation. When it comes to incorrect formulae we want to present only errors related to the interpretation meant by the user, hiding errors related to other interpretations (spurious errors).

We propose a heuristic to recognize spurious errors, which has been integrated with the disambiguation algorithm of [6].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Asperti, A., Guidi, F., Sacerdoti Coen, C., Tassi, E., Zacchiroli, S.: A content based mathematical search engine: Whelp. In: TYPES 2004. LNCS, vol. 3839, pp. 17–32. Springer, Heidelberg (2004)

    Google Scholar 

  2. Asperti, A., Sacerdoti Coen, C., Tassi, E., Zacchiroli, S.: User interaction with the Matita proof assistant. Journal of Automated Reasoning, Special Issue on User Interface for Theorem Proving (to appear, 2007)

    Google Scholar 

  3. Bancerek, G., Rudnicki, P.: Information retrieval in MML. In: Asperti, A., Buchberger, B., Davenport, J.H. (eds.) MKM 2003. LNCS, vol. 2594, Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Geuvers, H., Jojgov, G.I.: Open proofs and open terms: A basis for interactive logic. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 537–552. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. César Munoz. A Calculus of Substitutions for Incomplete-Proof Representation in Type Theory. PhD thesis, INRIA (November 1997)

    Google Scholar 

  6. 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)

    Google Scholar 

  7. Zentralblatt MATH, http://www.emis.de/ZMATH/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Manuel Kauers Manfred Kerber Robert Miner Wolfgang Windsteiger

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sacerdoti Coen, C., Zacchiroli, S. (2007). Spurious Disambiguation Error Detection. In: Kauers, M., Kerber, M., Miner, R., Windsteiger, W. (eds) Towards Mechanized Mathematical Assistants. MKM Calculemus 2007 2007. Lecture Notes in Computer Science(), vol 4573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73086-6_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73086-6_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73083-5

  • Online ISBN: 978-3-540-73086-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics