The Naproche Project. Controlled Natural Language Proof Checking of Mathematical Texts
This paper discusses the semi-formal language of mathematics and presents the Naproche CNL, a controlled natural language for mathematical authoring. Proof Representation Structures, an adaptation of Discourse Representation Structures, are used to...
mehr
|
Volltext:
|
|
|
Zitierfähiger Link:
|
|
|
This paper discusses the semi-formal language of mathematics and presents the Naproche CNL, a controlled natural language for mathematical authoring. Proof Representation Structures, an adaptation of Discourse Representation Structures, are used to represent the semantics of texts written in the Naproche CNL. We discuss how the Naproche CNL can be used in formal mathematics, and present our prototypical Naproche system, a computer program for parsing texts in the Naproche CNL and checking the proofs in them for logical correctness.
|
| Export in Literaturverwaltung |
|
Accentuation, Uncertainty and Exhaustivity - Towards a Model of Pragmatic Focus Interpretation
This paper presents a model of pragmatic focus interpretation that is assumed to be part of a complete language comprehension model and that is inspired by Levelt's language processing model. The model is derived from our empirical data on the role...
mehr
|
Volltext:
|
|
|
Zitierfähiger Link:
|
|
|
This paper presents a model of pragmatic focus interpretation that is assumed to be part of a complete language comprehension model and that is inspired by Levelt's language processing model. The model is derived from our empirical data on the role of accentuation, prosodic indicators of uncertainty and context for pragmatic focus interpretation. In its present state, the model is restricted to these data, but nevertheless generates predictions.
|
| Export in Literaturverwaltung |
|
From Proof Texts to Logic. Discourse Representation Structures for Proof Texts in Mathematics
We present an extension to Discourse Representation Theory that can be used to analyze mathematical texts written in the commonly used semi-formal language of mathematics (or at least a subset of it). Moreover, we describe an algorithm that can be...
mehr
|
Volltext:
|
|
|
Zitierfähiger Link:
|
|
|
We present an extension to Discourse Representation Theory that can be used to analyze mathematical texts written in the commonly used semi-formal language of mathematics (or at least a subset of it). Moreover, we describe an algorithm that can be used to check the resulting Proof Representation Structures for their logical validity and adequacy as a proof.
|
| Export in Literaturverwaltung |
|
