IEEE standard upper ontology: a progress report

Abstract

The IEEE Standard Upper Ontology (IEEE, 2001) is an effort to create a large, general-purpose, formal ontology. The ontology will be an open standard that can be reused for both academic and commercial purposes without fee, and it will be designed to support additional domain-specific ontologies. The effort is targeted for use in automated inference, semantic interoperability between heterogeneous information systems and natural language processing applications. The effort was begun in May 2000 with an e-mail discussion list, and since then there have been over 6000 e-mail messages among 170 subscribers. These subscribers include representatives from government, academia and industry in various countries. The effort was officially approved as an IEEE standards project in December 2000. Recently a successful workshop was held at IJCAI 2001 to discuss progress and proposals for this project (IJCAI, 2001).

Reasoning about Partially Ordered Web Service Activities in PSL

“…The ontologies in [5] and [11] lack axiomatizations in their respective languages, so that we cannot formalize the queries as entailment problems. Ontologies such as [12] and [9] provide axiomatizations, but they lack an explicit and complete characterization of the models of the axiomatizations. These approaches also fail to make the distinction between the axioms in ontology and the classes of sentences in the process descriptions.…”

Higher-order aspects and context in SUMO

“…LEO-II provides an own relevance filtering mechanism, and in our experiment this relevance filtering was always enabled. 7 In the following we call this flag setting of LEO-II the SUMO setting.…”

“…They are available under TPTP identifiers CSR119-CSR153. 7 The exact command options for LEO-II employed in our experiments were: leo <problem-file> -rf 2 -t 300.…”

“…Since SUO-KIF syntax is rather self-explaining we avoid a formal introduction here and provide some explanations on the fly. For further details we refer to [7].…”

“…Moreover, the mentioned conflict between SUMO's modeling of modal contexts and SUMO's implicit assumption of a bivalent, classical semantics is discussed. In Section 4 a mapping from SUMO's SUO-KIF representation language [7] to the TPTP THF0 language [8,9] is presented. TPTP THF0 is a practical syntax format for classical higherorder logic that enables the application of various off-the-shelf higher-order theorem provers.…”