On multiple context-free grammars
Theoretical Computer Science
The ALF proof editor and its proof engine
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Type-theoretical grammar
A report on OpenMath: a protocol for the exchange of mathematical information
ACM SIGSAM Bulletin
The object constraint language: precise modeling with UML
The object constraint language: precise modeling with UML
Building natural language generation systems
Building natural language generation systems
Towards a standard upper ontology
Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
Modern Compiler Implementation: In ML
Modern Compiler Implementation: In ML
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Context-Relative Syntactic Categories and the Formalization of Mathematical Text
TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
Omega: Towards a Mathematical Assistant
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Journal of Functional Programming
XML and multilingual document authoring: convergent trends
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Wide-coverage semantic representations from a CCG parser
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Computerizing Mathematical Text with MathLang
Electronic Notes in Theoretical Computer Science (ENTCS)
Attempto Controlled English for Knowledge Representation
Reasoning Web
A pattern for almost compositional functions
Journal of Functional Programming
Incremental parsing with parallel multiple context-free grammars
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
An extensible proof text editor
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Verification of object-oriented software: The KeY approach
Verification of object-oriented software: The KeY approach
Implementing controlled languages in GF
CNL'09 Proceedings of the 2009 conference on Controlled natural language
The naproche project controlled natural language proof checking of mathematical texts
CNL'09 Proceedings of the 2009 conference on Controlled natural language
Towards a more natural multilingual controlled language interface to OWL
IWCS '11 Proceedings of the Ninth International Conference on Computational Semantics
Grammatical Framework: Programming with Multilingual Grammars
Grammatical Framework: Programming with Multilingual Grammars
Recognising textual entailment with robust logical inference
MLCW'05 Proceedings of the First international conference on Machine Learning Challenges: evaluating Predictive Uncertainty Visual Object Classification, and Recognizing Textual Entailment
Translating formal software specifications to natural language
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Typeful ontologies with direct multilingual verbalization
CNL'10 Proceedings of the Second international conference on Controlled Natural Language
| Hi-index | 0.00 |
Natural language interfaces make formal systems accessible in informal language. They have a potential to make systems like theorem provers more widely used by students, mathematicians, and engineers who are not experts in logic. This paper shows that simple but still useful interfaces are easy to build with available technology. They are moreover easy to adapt to different formalisms and natural languages. The language can be made reasonably nice and stylistically varied. However, a fully general translation between logic and natural language also poses difficult, even unsolvable problems. This paper investigates what can be realistically expected and what problems are hard.