Journal of the ACM (JACM)
On Equivalents of Well-Foundedness
Journal of Automated Reasoning
A Refinement of de Bruijn's Formal Language of Mathematics
Journal of Logic, Language and Information
OMDoc -- An Open Markup Format for Mathematical Documents [version 1.2]: Foreword by Alan Bundy (Lecture Notes in Computer Science)
Mathematical knowledge browser with automatic hyperlink detection
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Toward an object-oriented structure for mathematical text
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Computerizing Mathematical Text with MathLang
Electronic Notes in Theoretical Computer Science (ENTCS)
MathLang Translation to Isabelle Syntax
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
Electronic geometry textbook: a geometric textbook knowledge management system
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Management of geometric knowledge in textbooks
Data & Knowledge Engineering
CICLing'13 Proceedings of the 14th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
Hi-index | 0.00 |
There are many styles for the narrative structure of a mathematical document. Each mathematician has its own conventions and traditions about labeling portions of texts (e.g., chapter, section, theorem or proof )and identifying statements according to their logical importance (e.g., theoremis more important than lemma). Such narrative/structuring labels guide the reader's navigation of the text and form the key components in the reasoning structure of the theory reflected in the text.We present in this paper a method to computerise the narrative structure of a text which includes the relationships between labeled text entities. These labels and relations are input by the user on top of their natural language text. This narrative structure is then automatically analysed to check its consistency. This automatic analysis consists of two phases: (1) checking the correct usage of labels and relations (i.e., that a "proof" justifies a "theorem" but cannot justify an "axiom") and (2) checking that the logical precedences in the document are self-consistent.The development of this method was driven by the experience of computerising a number of mathematical documents (covering different authoring styles). We illustrate how such computerised narrative structure could be used for further manipulations, i.e. to build a skeleton of a formal document in a formal system like Mizar, Coq or Isabelle.