| C. Zinn. Parsing formulae in textbook proofs. In H.C. Bunt and E.G.C. Thijsse, editors, Proceedings of the Third Int'l Workshop on Computational Semantics (IWCS-3), pages 422-424. Tilburg University, 1999. |
....of Theorem 2. Figure 1: The fundamental theorem of arithmetic at clearness and conciseness and not on an embellished style of expression [ van Gasteren, 1990 ] Albeit those characteristics, all kinds of linguistic phenomena which can occur in other text sorts, show also up in textbook proofs [ Zinn, 1999 ] Textbook proofs are, in general, a highly structured form of discourse. A crucial prerequisite to understand the course of the argumentation within a proof is to identify the discourse relations between sentences of that discourse. Deriving the discourse relations of a given textbook proof ....
C. Zinn. Parsing formulae in textbook proofs. In Third Int'l Workshop on Computational Semantics (IWCS-3), Tilburg, 1999.
....calculi (although one can easily identify some of them) That is, steps are only justi ed by other steps without citing the inference rules being involved in the reasoning. For similar criticism, see [RT96] 16 A selection of linguistic phenomena in mathematical discourse is discussed in [Zin99a, Zin99b]. 13 The Nature of Mathematical Discourse and Proof Planning. Mathematical discourse is di erent from other text genres. It has several advantages. First of all, mathematical discourse is a highly structured form of discourse. This is because (i) the domain of discourse is highly structured (a ....
C. Zinn. Parsing formulae in textbook proofs. In H.C. Bunt and E.G.C. Thijsse, editors, Proceedings of the Third Int'l Workshop on Computational Semantics (IWCS-3), pages 422-424. Tilburg University, 1999.
....common discourse purpose) and the informational structure (describing how sentences within a segment are related to each other by some relation) 13] of the proof. Albeit those characteristics, all kinds of linguistic phenomena which can occur in other text sorts, show also up in textbook proofs [21]. The automated reasoning view. Verifying textbook proofs is a deductive task and means to identify the logical structure of the proof: identifying assumptions and conclusions, the scope and quantification of variables, substructures which itself form subproofs etc. A theorem is always proven in ....
C. Zinn. Parsing formulae in textbook proofs. In H.C. Bunt and E.G.C. Thijsse, editors, Proceedings of the Third Int'l Workshop on Computational Semantics (IWCS-3), pages 422--424. Tilburg University, 1999.
....from textbook proofs and what is needed to formally verify textbook proofs The most recent work is Simon s PhD thesis [Sim90] which, however, fails to seriously address linguistic issues. An analysis of linguistic phenomena that occur in textbook proofs when formulae are involved is given in [Zin99]. Abstract discourse entities are treated by [Ash93] Asher differs between fact anaphora, event anaphora, concept anaphora and proposition anaphora. Only the latter has been treated in this paper. The DRS construction process we described begs some similarities to the one described in [Ash93] A ....
C. Zinn. Parsing formulae in textbook proofs. In H.C. Bunt and E.G.C. Thijsse, editors, Proceedings of the Third Int'l Workshop on ComputationalSemantics (IWCS-3), pages 422-- 424. Tilburg University, 1999.
....can handle anaphora and ellipsis. Also, an elaborate and deep treatment of discourse structure, necessary to follow the argumentation line, is lacking. A collection of linguistic phenomena which result solely from the presence of terms and formulae in textbook proofs has first been described in (Zinn, 1999). The task of checking textbook proofs offers also an interesting perspective for the community of Automated Deduction (Zinn, 1998) 5 Conclusion We proposed a new challenge problem to the linguistics community: build a system that understand mathematical textbook proofs. Realizing such a system ....
C. Zinn. 1999. Parsing formulae in textbook proofs. In H.C. Bunt and E.G.C. Thijsse, editors, Proceedings of the Third Int'l Workshop on Computational Semantics (IWCS-3), pages 422--424. Tilburg University.
....is lacking. Similar attempts to parse texts in the mathematics and physics domain are (Bobrow, 1964) Charniak, 1969) and (Bundy, Byrd, and Luger, 1979) A collection of linguistic phenomena which result solely from the presence of terms and formulae in textbook proofs has first been described in (Zinn, 1999). The task of checking textbook proofs offers also an interesting perspective for the community of Automated Deduction (Zinn, 1998) 5 Conclusion The goal of this paper is to shed some light on the relationship between discourse structure and reference in the mathematical domain. A prerequisite ....
Zinn, C. 1999. Parsing formulae in textbook proofs.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC