Chan Le Duc

Reasoning with a Network of Aligned Ontologies

In the context of the Semantic Web or semantic peer to peer systems, many ontologies may exist and be developed independently. Ontology alignments help integrating, mediating or reasoning with a system of networked ontologies. Though different formalisms have already been defined to reason with such systems, they do not consider ontology alignments as first class objects designed by third party ontology matching systems. Correspondences between ontologies are often asserted from an external point of view encompassing both ontologies. We study consistency checking in a network of aligned ontologies represented in Integrated Distributed Description Logics ( IDDL ). This formalism treats local knowledge (ontologies) and global knowledge (inter-ontology semantic relations, i.e. alignments) separately by distinguishing local interpretations and global interpretation so that local systems do not need to directly connect to each other. We consequently devise a correct and complete algorithm which, although being far from tractacle, has interesting properties: it is independent from the local logics expressing ontologies by encapsulating local reasoners. This shows that consistency of a IDDL system is decidable whenever consistency of the local logics is decidable. Moreover, the expressiveness of local logics does not need to be known as long as local reasoners can handle at least

On the Potential Integration of an Ontology-Based Data Access Approach in NoSQL Stores

\mathcal{ALC}

Sharing and reusing aligned ontologies with cupboard

.

On The Potential Integration of an Ontology-Based Data Access Approach in NoSQL Stores

No SQL stores are emerging as an efficient alternative to relational database management systems in the context of big data. Many actors in this domain consider that to gain a wider adoption, several extensions have to be integrated. Some of them focus on the ways of proposing more schema, supporting adapted declarative query languages and providing integrity constraints in order to control data consistency and enhance data quality. We consider that these issues can be dealt with in the context of Ontology Based Data Access (OBDA). OBDA is a new data management paradigm that exploits the semantic knowledge represented in ontologies when querying data stored in a database. We provide a proof of concept of OBDAs ability to tackle these three issues in a social application related to the medical domain.

Methodological Guidelines for Matching Ontologies

This demo presents the Cupboard online system for sharing and reusing ontologies linked together with alignments, and that are attached to rich metadata and reviews.

A Decision Procedure for

NoSQL stores are emerging as an efficient alternative to relational database management systems in the context of big data. Many actors in this domain consider that to gain a wider adoption, several extensions have to be integrated. Some of them focus on the ways of proposing more schemas, supporting adapted declarative query languages and providing integrity constraints in order to control data consistency and enhance data quality. The authors consider that these issues can be dealt with in the context of Ontology Based Data Access OBDA. OBDA is a new data management paradigm that exploits the semantic knowledge represented in ontologies when querying data stored in a database. They provide a proof of concept of OBDAs ability to tackle these three issues in a social application related to the medical domain.

\mathcal{SHOIQ}

Finding alignments between ontologies is a very important operation for ontology engineering. It allows for establishing links between ontologies, either to integrate them in an application or to relate developed ontologies to context. It is even more critical for networked ontologies. Incorrect alignments may lead to unwanted consequences throughout the whole network, and incomplete alignments may fail to provide the expected consequences. Yet, there is no well-established methodology available for matching ontologies. We propose methodological guidelines that build on previously disconnected results and experiences.

with Transitive Closure of Roles

The Semantic Web makes an extensive use of the OWL DL ontology language, underlied by the

Tableau-based revision for expressive description logics with individuals

\mathcal{SHOIQ}

Incremental checking of Master Data Management model based on contextual graphs

description logic, to formalize its resources. In this paper, we propose a decision procedure for this logic extended with the transitive closure of roles in concept axioms, a feature needed in several application domains. The most challenging issue we have to deal with when designing such a decision procedure is to represent infinitely non-tree-shaped models, which are different from those of