Abstract
We present results of our work on using first order theorem proving to reason over a large ontology (the Suggested Upper Merged Ontology - SUMO), and methods for making SUMO suitable for first order theorem proving. We describe the methods for translating into standard first order format, as well as optimizations that are intended to improve inference performance. We also describe our work in translating SUMO from its native SUO-KIF language into TPTP format.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 61-70 |
| Number of pages | 10 |
| Journal | CEUR Workshop Proceedings |
| Volume | 257 |
| State | Published - Dec 1 2007 |
| Event | 21st CADE 2007 Workshop on Empirically Successful Automated Reasoning in Large Theories, ESARLT 2007 - Bremen, Germany Duration: Jul 17 2007 → Jul 17 2007 |
ASJC Scopus subject areas
- Computer Science(all)