A Preliminary Ontology for Spermatozoa Analysis

Biomedical computation has used ontologies as a foundation for building knowledge-based systems and technologies for SemanticWeb applications. However, so far they had not been utilized in andrology related domains. This paper presents a preliminary effort to provide a comprehensive ontology for classifying and managing spermatozoa samples and their phenotypic traits, in order to analyze and diagnose them. Our study is centered around the development of a Computer Asisted Sperm Analysis (CASA) system.Sociedad Argentina de Informática e Investigación Operativa (SADIO

A Preliminary Ontology for Spermatozoa Analysis

Biomedical computation has used ontologies as a foundation for building knowledge-based systems and technologies for SemanticWeb applications. However, so far they had not been utilized in andrology related domains. This paper presents a preliminary effort to provide a comprehensive ontology for classifying and managing spermatozoa samples and their phenotypic traits, in order to analyze and diagnose them. Our study is centered around the development of a Computer Asisted Sperm Analysis (CASA) system.Sociedad Argentina de Informática e Investigación Operativa (SADIO

Web ontology representation and reasoning via fragments of set theory

In this paper we use results from Computable Set Theory as a means to represent and reason about description logics and rule languages for the semantic web. Specifically, we introduce the description logic \mathcal{DL}\langle 4LQS^R\rangle(\D)--admitting features such as min/max cardinality constructs on the left-hand/right-hand side of inclusion axioms, role chain axioms, and datatypes--which turns out to be quite expressive if compared with \mathcal{SROIQ}(\D), the description logic underpinning the Web Ontology Language OWL. Then we show that the consistency problem for \mathcal{DL}\langle 4LQS^R\rangle(\D)-knowledge bases is decidable by reducing it, through a suitable translation process, to the satisfiability problem of the stratified fragment $4LQS^R$ of set theory, involving variables of four sorts and a restricted form of quantification. We prove also that, under suitable not very restrictive constraints, the consistency problem for \mathcal{DL}\langle 4LQS^R\rangle(\D)-knowledge bases is \textbf{NP}-complete. Finally, we provide a $4LQS^R$-translation of rules belonging to the Semantic Web Rule Language (SWRL)

Requirements and services for metadata management

Knowledge-intensive applications pose new challenges to metadata management, including distribution, access control, uniformity of access, and evolution in time. The authors identify general requirements for metadata management and describe a simple model and service that focuses on RDF metadata to address these requirements

Infusion: a hybrid reasoning system with description logics.

We discussed a new approach using inference fusion, i.e. the cooperative reasoning from distributed heterogeneous inference systems, to extend the expressive and deductive powers of existing Description Logic (DL) based systems. More specifically, our approach integrates results from a DL reasoner with results from a constraint solver. Inference fusion (i) fragments heterogeneous input knowledge to generate suitable homogeneous inputs for the DL and constraint reasoners; (ii) passes control to each reasoner, retrieving the results and making them available to the other reasoner for further inferencing; and (iii) dynamically combines the results of the two reasoners to present the overall conclusion. We also outline the main features of inference fusion by way of a small example

Description Logics as Ontology Languages for the Semantic Web

The vision of a Semantic Web has recently drawn considerable attention, both from academia and industry. Description logics are often named as one of the tools that can support the Semantic Web and thus help to make this vision reality. In this paper, we describe what description logics are and what they can do for the Semantic Web. Descriptions logics are very useful for defining, integrating, and maintaining ontologies, which provide the Semantic Web with a common understanding of the basic semantic concepts used to annotate Web pages. We also argue that, without the last decade of basic research in this area, description logics could not play such an important rˆole in this domain

An Analysis of Service Ontologies

Services are increasingly shaping the world’s economic activity. Service provision and consumption have been profiting from advances in ICT, but the decentralization and heterogeneity of the involved service entities still pose engineering challenges. One of these challenges is to achieve semantic interoperability among these autonomous entities. Semantic web technology aims at addressing this challenge on a large scale, and has matured over the last years. This is evident from the various efforts reported in the literature in which service knowledge is represented in terms of ontologies developed either in individual research projects or in standardization bodies. This paper aims at analyzing the most relevant service ontologies available today for their suitability to cope with the service semantic interoperability challenge. We take the vision of the Internet of Services (IoS) as our motivation to identify the requirements for service ontologies. We adopt a formal approach to ontology design and evaluation in our analysis. We start by defining informal competency questions derived from a motivating scenario, and we identify relevant concepts and properties in service ontologies that match the formal ontological representation of these questions. We analyze the service ontologies with our concepts and questions, so that each ontology is positioned and evaluated according to its utility. The gaps we identify as the result of our analysis provide an indication of open challenges and future work

Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies

We present a terminating tableau calculus for graded hybrid logic with global modalities, reflexivity, transitivity and role hierarchies. Termination of the system is achieved through pattern-based blocking. Previous approaches to related logics all rely on chain-based blocking. Besides being conceptually simple and suitable for efficient implementation, the pattern-based approach gives us a NExpTime complexity bound for the decision procedure