Agent-based semantic composition of Web services using distributed description logics

International audienceAn important research challenge consists in composing web services in an automatic and distributed manner on a large scale. Indeed, most queries can not be satisfiable by one service and must be processed by composing several services. Each web service is often written by different designers and is described using the terms of their own ontology. Therefore, the composition process needs to deal with a variety of heterogeneous ontologies. In order to tackle this challenge, we propose an approach using Distributed Description Logics (DDL) to achieve the semantic composition of web services. DDL allows one to make semantic connections between ontologies and thus web services, as well as to reason to get a semantic composition of web services

Distributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web

In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we consider peer-to-peer inference systems in which the local theory of each peer is a set of propositional clauses defined upon a local vocabulary. An important characteristic of peer-to-peer inference systems is that the global theory (the union of all peer theories) is not known (as opposed to partition-based reasoning systems). The main contribution of this paper is to provide the first consequence finding algorithm in a peer-to-peer setting: DeCA. It is anytime and computes consequences gradually from the solicited peer to peers that are more and more distant. We exhibit a sufficient condition on the acquaintance graph of the peer-to-peer inference system for guaranteeing the completeness of this algorithm. Another important contribution is to apply this general distributed reasoning setting to the setting of the Semantic Web through the Somewhere semantic peer-to-peer data management system. The last contribution of this paper is to provide an experimental analysis of the scalability of the peer-to-peer infrastructure that we propose, on large networks of 1000 peers

Decentralized case-based reasoning and Semantic Web technologies applied to decision support in oncology

International audienceThis article presents the Kasimir system dedicated to decision knowledge management in oncology and which is built on top of Semantic Web technologies, taking benefit from standard knowledge representation formalisms and open reasoning tools. The representation of medical decision protocols, in particular for breast cancer treatment, is based on concepts and instances implemented within the description logic OWL DL. The knowledge units related to a protocol can then be applied for solving specific medical problems, using instance or concept classification. However, the straight application of a protocol is not always satisfactory, e.g., because of contraindications, necessitating an adaptation of the protocol. This is why the principles and methods of case-based reasoning in the framework of description logics have been used. In addition, the domain of oncology is complex and involves several specialties, e.g. surgery and chemotherapy. This complexity can be better undertaken with a viewpoint-based representation of protocols and viewpoint-based reasoning, for either application or adaptation of the protocols. Accordingly, a distributed description logic has been used for representing a viewpoint-based protocol. The application and the adaptation of the viewpoint-based protocol to medical cases is carried out using global instance classification and decentralized case-based reasoning

Federated description logics for the semantic web

The thesis deals with a family of federated description logics for creating modular ontologies in the semantic web. All these logics share modularity, the possibility to reuse concept names and role names by importing, and context-sensitive interpretation of all logical connectives. Apart from the main basic language F-ALCI, we present a lattice-based extension LF-ALCI, a probabilistic extension PF-ALCI and an extension that employs knowledge operators F-ALCIK. All languages are based on the ordinary well-known description logic ALCI

A Language for Inconsistency-Tolerant Ontology Mapping

Ontology alignment plays a key role in enabling interoperability among various data sources present in the web. The nature of the world is such, that the same concepts differ in meaning, often so slightly, which makes it difficult to relate these concepts. It is the omni-present heterogeneity that is at the core of the web. The research work presented in this dissertation, is driven by the goal of providing a robust ontology alignment language for the semantic web, as we show that description logics based alignment languages are not suitable for aligning ontologies. The adoption of the semantic web technologies has been consistently on the rise over the past decade, and it continues to show promise. The core component of the semantic web is the set of knowledge representation languages -- mainly the W3C (World Wide Web Consortium) standards Web Ontology Language (OWL), Resource Description Framework (RDF), and Rule Interchange Format (RIF). While these languages have been designed in order to be suitable for the openness and extensibility of the web, they lack certain features which we try to address in this dissertation. One such missing component is the lack of non-monotonic features, in the knowledge representation languages, that enable us to perform common sense reasoning. For example, OWL supports the open world assumption (OWA), which means that knowledge about everything is assumed to be possibly incomplete at any point of time. However, experience has shown that there are situations that require us to assume that certain parts of the knowledge base are complete. Employing the Closed World Assumption (CWA) helps us achieve this. Circumscription is a very well-known approach towards CWA, which provides closed world semantics by employing the idea of minimal models with respect to certain predicates which are closed. We provide the formal semantics of the notion of Grounded Circumscription, which is an extension of circumscription with desirable properties like decidability. We also provide a tableaux calculus to reason over knowledge bases under the notion of grounded circumscription. Another form of common sense logic, is default logic. Default logic provides a way to specify rules that, by default, hold in most cases but not necessarily in all cases. The classic example of such a rule is: If something is a bird then it flies. The power of defaults comes from the ability of the logic to handle exceptions to the default rules. For example, a bird will be assumed to fly by default unless it is an exception, i.e. it belongs to a class of birds that do not fly, like penguins. Interestingly, this property of defaults can be utilized to create mappings between concepts of different ontologies (knowledge bases). We provide a new semantics for the integration of defaults in description logics and show that it improves upon previously known results in literature. In this study, we give various examples to show the utility and advantages of using a default logic based ontology alignment language. We provide the semantics and decidability results of a default based mapping language for tractable fragments of description logics (or OWL). Furthermore, we provide a proof of concept system and qualitative analysis of the results obtained from the system when compared to that of traditional mapping repair techniques

Local tableaux for reasoning in distributed description logics

The last decade of basic research in the area of Description Logics (DL) has created a stable theory, efficient inference procedures, and has demonstrated a wide applicability of DL to knowledge representation and reasoning. The success of DL in the semantic web and the distributed nature of the last one inspired recently a proposal of Distributed DL framework (DDL). DDL is composed of a set of stand alone DLs pairwise interrelated with each other via collection of bridge rules. In this paper, we investigate the reasoning mechanisms in DDL and introduce a tableau-based reasoning algorithm for DDL, built on the top of the state of the art tableaux reasoners for DL. We also describe a first prototype implementation of the proposed algorith