Improving Ontology Recommendation and Reuse in WebCORE by Collaborative Assessments

In this work, we present an extension of CORE [8], a tool for Collaborative Ontology Reuse and Evaluation. The system receives an informal description of a specific semantic domain and determines which ontologies from a repository are the most appropriate to describe the given domain. For this task, the environment is divided into three modules. The first component receives the problem description as a set of terms, and allows the user to refine and enlarge it using WordNet. The second module applies multiple automatic criteria to evaluate the ontologies of the repository, and determines which ones fit best the problem description. A ranked list of ontologies is returned for each criterion, and the lists are combined by means of rank fusion techniques. Finally, the third component uses manual user evaluations in order to incorporate a human, collaborative assessment of the ontologies. The new version of the system incorporates several novelties, such as its implementation as a web application; the incorporation of a NLP module to manage the problem definitions; modifications on the automatic ontology retrieval strategies; and a collaborative framework to find potential relevant terms according to previous user queries. Finally, we present some early experiments on ontology retrieval and evaluation, showing the benefits of our system

Computing Horn Rewritings of Description Logics Ontologies

We study the problem of rewriting an ontology O1 expressed in a DL L1 into an ontology O2 in a Horn DL L2 such that O1 and O2 are equisatisfiable when extended with an arbitrary dataset. Ontologies that admit such rewritings are amenable to reasoning techniques ensuring tractability in data complexity. After showing undecidability whenever L1 extends ALCF, we focus on devising efficiently checkable conditions that ensure existence of a Horn rewriting. By lifting existing techniques for rewriting Disjunctive Datalog programs into plain Datalog to the case of arbitrary first-order programs with function symbols, we identify a class of ontologies that admit Horn rewritings of polynomial size. Our experiments indicate that many real-world ontologies satisfy our sufficient conditions and thus admit polynomial Horn rewritings.Comment: 15 pages. To appear in IJCAI-1

The combined approach to ontology-based data access

The use of ontologies for accessing data is one of the most exciting new applications of description logics in databases and other information systems. A realistic way of realising sufficiently scalable ontology- based data access in practice is by reduction to querying relational databases. In this paper, we describe the combined approach, which incorporates the information given by the ontology into the data and employs query rewriting to eliminate spurious answers. We illustrate this approach for ontologies given in the DL-Lite family of description logics and briefly discuss the results obtained for the EL family

The Form of Organization for Small Business

Matching and integrating ontologies has been a desirable technique in areas such as data fusion, knowledge integration, the Semantic Web and the development of advanced services in distributed system. Unfortunately, the heterogeneities of ontologies cause big obstacles in the development of this technique. This licentiate thesis describes an approach to tackle the problem of ontology integration using description logics and production rules, both on a syntactic level and on a semantic level. Concepts in ontologies are matched and integrated to generate ontology intersections. Context is extracted and rules for handling heterogeneous ontology reasoning with contexts are developed. Ontologies are integrated by two processes. The first integration is to generate an ontology intersection from two OWL ontologies. The result is an ontology intersection, which is an independent ontology containing non-contradictory assertions based on the original ontologies. The second integration is carried out by rules that extract context, such as ontology content and ontology description data, e.g. time and ontology creator. The integration is designed for conceptual ontology integration. The information of instances isn't considered, neither in the integrating process nor in the integrating results. An ontology reasoner is used in the integration process for non-violation check of two OWL ontologies and a rule engine for handling conflicts according to production rules. The ontology reasoner checks the satisfiability of concepts with the help of anchors, i.e. synonyms and string-identical entities; production rules are applied to integrate ontologies, with the constraint that the original ontologies should not be violated. The second integration process is carried out with production rules with context data of the ontologies. Ontology reasoning, in a repository, is conducted within the boundary of each ontology. Nonetheless, with context rules, reasoning is carried out across ontologies. The contents of an ontology provide context for its defined entities and are extracted to provide context with the help of an ontology reasoner. Metadata of ontologies are criteria that are useful for describing ontologies. Rules using context, also called context rules, are developed and in-built in the repository. New rules can also be added. The scientific contribution of the thesis is the suggested approach applying semantic based techniques to provide a complementary method for ontology matching and integrating semantically. With the illustration of the ontology integration process and the context rules and a few manually integrated ontology results, the approach shows the potential to help to develop advanced knowledge-based services.QC 20130201</p

Conjunctive query inseparability of OWL 2 QL TBoxes

The OWL2 profile OWL 2 QL, 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 of query inseparability (or equivalence) for OWL 2 QL ontologies and show that deciding query inseparability is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by experiments that they can be used for practical module extraction

A Framework for Design and Composition of Semantic Web Services

Semantic Web Services (SWS) are Web Services (WS) whose description is semantically enhanced with markup languages (e.g., OWL-S). This semantic description will enable external agents and programs to discover, compose and invoke SWSs. However, as a previous step to the specification of SWSs in a language, it must be designed at a conceptual level to guarantee its correctness and avoid inconsistencies among its internal components. In this paper, we present a framework for design and (semi) automatic composition of SWSs at a language-independent and knowledge level. This framework is based on a stack of ontologies that (1) describe the different parts of a SWS; and (2) contain a set of axioms that are really design rules to be verified by the ontology instances. Based on these ontologies, design and composition of SWSs can be viewed as the correct instantiation of the ontologies themselves. Once these instances have been created they will be exported to SWS languages such as OWL-S

Shiva: A Framework for Graph Based Ontology Matching

Since long, corporations are looking for knowledge sources which can provide structured description of data and can focus on meaning and shared understanding. Structures which can facilitate open world assumptions and can be flexible enough to incorporate and recognize more than one name for an entity. A source whose major purpose is to facilitate human communication and interoperability. Clearly, databases fail to provide these features and ontologies have emerged as an alternative choice, but corporations working on same domain tend to make different ontologies. The problem occurs when they want to share their data/knowledge. Thus we need tools to merge ontologies into one. This task is termed as ontology matching. This is an emerging area and still we have to go a long way in having an ideal matcher which can produce good results. In this paper we have shown a framework to matching ontologies using graphs

Unification in the Description Logic EL

The Description Logic EL has recently drawn considerable attention since, on the one hand, important inference problems such as the subsumption problem are polynomial. On the other hand, EL is used to define large biomedical ontologies. Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. The main result of this paper is that unification in EL is decidable. More precisely, EL-unification is NP-complete, and thus has the same complexity as EL-matching. We also show that, w.r.t. the unification type, EL is less well-behaved: it is of type zero, which in particular implies that there are unification problems that have no finite complete set of unifiers.Comment: 31page

The Knowledge of the Grid: A Grid Ontology

This paper presents a knowledge architecture and set of ontologies that can be used as the foundation to facilitate the matching of abstract resource requests to services and resources, to determine the functional equivalence of Grid middle wares and deployments and to allow the description of ‘hybrid’ compound Grids composed of individual heterogeneous Grids. This is necessary as in all these cases what is required is mediation between different views or descriptions of Grids, which requires a formal reference vocabulary. We present a framework and ontologies for achieving this