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 suita...
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
The problem of decomposing domains into sensible factors is addressed and solved for the case of dI-domains. A decomposition theorem is proved which allows the represention of a l...
The goal of this paper is to present how the Prolog Technology Theorem Proving (PTTP) approach can be used for ABox-reasoning. This work presents an inference algorithm over the l...