F. Kamareddine, M. Maarek, K. Retel, and J. Wells. Proceedings of the Sixth International Conference on MATHEMATICAL KNOWLEDGE MANAGEMENT, Lecture Notes in AI 4573, page 296-312. Springer, (2007)
Abstract
There are many styles for the narrative structure of a mathe-
matical document. Each mathematician has its own conventions and tra-
ditions about labeling portions of texts (e.g., chapter, section, theorem or
proof ) and identifying statements according to their logical importance
(e.g., theorem is more important than lemma). Such narrative/struc-
turing 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 good-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 com-
puterising a number of mathematical documents (covering different au-
thoring 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.
%0 Conference Paper
%1 kamareddine2007narrative
%A Kamareddine, Fairouz
%A Maarek, Manuel
%A Retel, Krzysztof
%A Wells, Joe B.
%B Proceedings of the Sixth International Conference on MATHEMATICAL KNOWLEDGE MANAGEMENT
%D 2007
%E Kauers, M.
%E Kerber, Manfred
%E Miner, Robert
%E Windsteiger, Wolfgang
%I Springer
%K formal knowledge logic managment mathematics narrative
%P 296-312
%T Narrative structure of mathematical texts
%U http://www.cedar-forest.org/forest/papers/conference-publications/mkm07-linz-dca.pdf
%V Lecture Notes in AI 4573
%X There are many styles for the narrative structure of a mathe-
matical document. Each mathematician has its own conventions and tra-
ditions about labeling portions of texts (e.g., chapter, section, theorem or
proof ) and identifying statements according to their logical importance
(e.g., theorem is more important than lemma). Such narrative/struc-
turing 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 good-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 com-
puterising a number of mathematical documents (covering different au-
thoring 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.
%@ 978-3-540-73083-5
@inproceedings{kamareddine2007narrative,
abstract = {There are many styles for the narrative structure of a mathe-
matical document. Each mathematician has its own conventions and tra-
ditions about labeling portions of texts (e.g., chapter, section, theorem or
proof ) and identifying statements according to their logical importance
(e.g., theorem is more important than lemma). Such narrative/struc-
turing 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 good-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 com-
puterising a number of mathematical documents (covering different au-
thoring 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.},
added-at = {2009-07-10T20:18:57.000+0200},
author = {Kamareddine, Fairouz and Maarek, Manuel and Retel, Krzysztof and Wells, Joe B.},
biburl = {https://www.bibsonomy.org/bibtex/2d0b8d39665cfadbc5cb807ec4b2a219f/yish},
booktitle = {Proceedings of the Sixth International Conference on MATHEMATICAL KNOWLEDGE MANAGEMENT},
editor = {Kauers, M. and Kerber, Manfred and Miner, Robert and Windsteiger, Wolfgang},
interhash = {5b908578519e478e4d2c0fd39fa8c852},
intrahash = {d0b8d39665cfadbc5cb807ec4b2a219f},
isbn = {978-3-540-73083-5},
keywords = {formal knowledge logic managment mathematics narrative},
pages = {296-312},
publisher = {Springer},
timestamp = {2009-07-10T20:18:57.000+0200},
title = {Narrative structure of mathematical texts},
url = {http://www.cedar-forest.org/forest/papers/conference-publications/mkm07-linz-dca.pdf},
volume = {Lecture Notes in AI 4573},
year = 2007
}