Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets
Journal of the ACM (JACM)
Towards a standard upper ontology
Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
Journal of Functional Programming
Enabling technology for multilingual natural language generation: the KPML development environment
Natural Language Engineering
Grammatical framework web service
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session
The TPTP Problem Library and Associated Infrastructure
Journal of Automated Reasoning
PGF: A Portable Run-time Format for Type-theoretical Grammars
Journal of Logic, Language and Information
Translating between language and logic: what is easy and what is difficult
CADE'11 Proceedings of the 23rd international conference on Automated deduction
A type-theoretical approach for ontologies: The case of roles
Applied Ontology
Hi-index | 0.00 |
We have developed a methodology for representation of ontologies in a strictly typed language with dependent types. The methodology is supported by an experiment where we translated SUMO (Suggested Upper-Merged Ontology) to GF (Grammatical Framework). The representation of SUMO in GF preserves the expressivity of the original ontology, adding to this the advantages of a type system and built-in support for natural language generation. SUMO is the largest open-source ontology describing over 10,000 concepts and the relations between them, along with a number of first-order axioms, which are further on used in performing automated reasoning on the ontology. GF is a type-theoretical grammar formalism mainly used for natural language applications. Through the logical framework that it incorporates, GF allows a consistent ontology representation, and thanks to its grammatical features the ontology is directly verbalized in a number of controlled natural languages.