Learn More
We consider the problem of computing the logical difference between distinct versions of description logic terminologies. For the lightweight description logic EL, we present a tractable algorithm which, given two terminologies and a signature, outputs a set of concepts, which can be regarded as the logical difference between the two terminologies. As a(More)
We develop a framework for forgetting concepts and roles (aka uniform interpolation) in terminologies in the lightweight description logic EL extended with role inclusions and domain and range restrictions. Three different notions of forgetting, preserving, respectively, concept inclusions, concept instances, and answers to conjunctive queries, with(More)
We present TeMP—the first experimental system for testing validity of monodic temporal logic formulae. The prover implements fine-grained temporal resolution. The core operations required by the procedure are performed by an efficient resolution-based prover for classical first-order logic. 1 Monodic First-Order Temporal Logic First-Order Temporal Logic,(More)
The aim of this paper is to study semantic notions of modularity in description logic (DL) terminologies and reasoning problems that are relevant for modularity. We define two notions of a module whose independence is formalised in a model-theoretic way. Focusing mainly on the DLs EL and ALC, we then develop algorithms for module extraction, for checking(More)
We develop a clausal resolution-based approach for computing uniform interpolants of TBoxes formulated in the description logicALC when such uniform interpolants exist. We also present an experimental evaluation of our approach and its applications to concept forgetting, ontology obfuscation and logical difference on real-life ALC ontologies. Our results(More)
Temporal logics are extensions of classical logic with operators that deal with time. They have been used in a wide variety of areas within Computer Science and Artificial Intelligence, for example robotics [14], databases [15], hardware verification [8] and agent-based systems [12]. In this paper we present TRP++ Version 2.0, a theorem prover for(More)
Modularity of ontologies is currently an active research field, and many different notions of a module have been proposed. In this paper, we review the fundamental principles of modularity and identify formal properties that a robust notion of modularity should satisfy. We explore these properties in detail in the contexts of description logic and classical(More)
The OWL2 profile OWL2QL, based on the DL-Lite family of description logics, is emerging as a major language for developing new ontologies and approximating the existing ones. Its main application is ontology-based data access, where ontologies are used to provide background knowledge for answering queries over data. We investigate the corresponding notion(More)
We develop a clausal resolution-based approach for computing uniform interpolants of TBoxes formulated in the description logic ALC when such uniform interpolants exist. We also present an experimental evaluation of our approach and of its application to the logical difference problem for real-life ALC ontologies. Our results indicate that in many practical(More)
We study a logic-based approach to versioning of ontologies. Under this view, ontologies provide answers to queries about some vocabulary of interest. The difference between two versions of an ontology is given by the set of queries that receive different answers. We investigate this approach for terminologies given in the description logic EL extended with(More)