System Description: SystemOn TPTP
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
The TPTP world - infrastructure for automated reasoning
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Translating between language and logic: what is easy and what is difficult
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Parsing and disambiguation of symbolic mathematics in the Naproche system
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Premise selection in the naproche system
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
DynGenPar: a dynamic generalized parser for common mathematical language
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Overview and evaluation of premise selection techniques for large theory mathematics
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Interpreting plurals in the naproche CNL
CNL'10 Proceedings of the Second international conference on Controlled Natural Language
Preprocessing of informal mathematical discourse in context ofcontrolled natural language
Proceedings of the 21st ACM international conference on Information and knowledge management
CICLing'13 Proceedings of the 14th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
Hi-index | 0.00 |
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.