Evaluating general purpose automated theorem proving systems
Artificial Intelligence
Towards a standard upper ontology
Proceedings of the international conference on Formal Ontology in Information Systems - Volume 2001
The design and implementation of VAMPIRE
AI Communications - CASC
AI Communications - CASC
The 4th IJCAR Automated Theorem Proving System Competition - CASC-J4
AI Communications
Linking FrameNet to the Suggested Upper Merged Ontology
Proceedings of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006)
Source-level proof reconstruction for interactive theorem proving
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Domains and context: First steps towards managing diversity in knowledge
Web Semantics: Science, Services and Agents on the World Wide Web
Higher-order aspects and context in SUMO
Web Semantics: Science, Services and Agents on the World Wide Web
Sigma: An integrated development environment for formal ontology
AI Communications - Intelligent Engineering Techniques for Knowledge Bases
Hi-index | 0.01 |
The Suggested Upper Merged Ontology (SUMO) has provided the TPTP problem library with problems that have large numbers of axioms, of which typically only a few are needed to prove any given conjecture. The LTB division of the CADE ATP System Competition tests the performance of ATP systems on these types of problems. The SUMO problems were used in the SMO category of the LTB division in 2008. This paper presents an analysis of the performance of the 2007 and 2008 CASC entrants on the SUMO problems, illustrating the improvements that can be achieved by various tuning techniques.