Learn More
We describe an extension of the description logic underlying OWLDL, SHOIN , with a number of expressive means that we believe will make it more useful in practise. Roughly speaking, we extend SHOIN with all expressive means that were suggested to us by ontology developers as useful additions to OWL-DL, and which, additionally, do not affect its(More)
Combining knowledge representation and reasoning formalisms is an important and challenging task. It is important because non-trivial AI applications often comprise different aspects of the world, thus requiring suitable combinations of available formalisms modeling each of these aspects. It is challenging because the computational behavior of the resulting(More)
Motivated primarily by medical terminology applications, the prominent DL SHIQ has already been extended to a DL with complex role inclusion axioms of the form R ◦ S v̇ R or S ◦ R v̇ R, called RIQ, and the SHIQ tableau algorithm has been extended to handle such inclusions. This paper further extends RIQ and its tableau algorithm with important expressive(More)
In this paper, we compare various formalisms that have been recently introduced or used for distributed reasoning, ontology integration, and related topics; in particular, we focus on E-connections, Distributed Description Logics, and Package-based Description Logics. We then establish the relationship between these formalisms and various nonstandard(More)
1 Motivation Combining description logics (DLs) with other logical formalisms, including other DLs, is an important and challenging task. Recent examples include: 1. the combination of DLs with temporal logics to form multi-dimensional temporal DLs, cf. e.g. [1, 6, 10]; 2. the fusion of multiple DLs into a single formalism that inherits decidability from(More)
We introduce a new semantics for modal predicate logic, with respect to which a rich class of first-order modal logics is complete, namely all normal first-order modal logics that are extensions of free quantified K. This logic is defined by combining positive free logic with equality PFL . = and the propositional modal logic K. We then uniformly(More)
In realistic applications, it is often desirable to integrate different ontologies into a single, reconciled ontology. Ideally, one would expect the individual ontologies to be developed as independently as possible, and the final reconciliation to be seamless and free from unexpected results. This allows for the modular design of large ontologies and(More)
We propose a novel technique for proving the consistency of large, complex and heterogeneous theories for which ‘standard’ automated reasoning methods are considered insufficient. In particular, we exemplify the applicability of the method by establishing the consistency of the foundational ontology DOLCE, a large, first-order ontology. The approach we(More)