Graph-Based Ontology Classification in OWL 2 QL

Lembo, Domenico; Santarelli, Valerio; Savo, Domenico Fabio

doi:10.1007/978-3-642-38288-8_22

Cited by 12 publications

(12 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This version of the algorithm for ontology classification and the results that have been achieved after extensive evaluation have been submitted [23] and are available from the authors.…”

Section: Theorem 1 Let T Be a Dl-liter Tbox And Let Gt = (N E)mentioning

confidence: 99%

Towards efficient and practical solutions for ontology-based data management

Santarelli

Lembo

2013

Proceedings of the Joint EDBT/ICDT 2013 Workshops

Self Cite

View full text Add to dashboard Cite

This paper presents the research summary of my Ph.D. plan, which is currently in the early stages of its development. The objectives around which my work is focusing and that I will continue to pursue throughout the remainder of my doctoral activities are the development of tools and the definition of a methodology for the execution of those tasks that are typically performed when working with ontologies in the context of Ontology-Based Data Access (OBDA). The objective of this methodology is to guide the ontology engineer through ontology design, representation and approximation, and the issues I will address in order to provide the necessary tools to achieve this goal are the optimization of ontology classification in DL-Lite, the definition of a graphical language tailored towards ontologies, and the study of approximation of ontologies in expressive languages into DL-Lite logics. Such methodology proves to be necessary when facing the numerous challenges that often arise in real-world scenarios, in which the amount of data that is managed by information systems, and the processes that manage and act on this data grow continuously. © 2013 ACM

show abstract

“…This version of the algorithm for ontology classification and the results that have been achieved after extensive evaluation have been submitted [23] and are available from the authors.…”

Section: Theorem 1 Let T Be a Dl-liter Tbox And Let Gt = (N E)mentioning

confidence: 99%

Towards efficient and practical solutions for ontology-based data management

Santarelli

Lembo

2013

Proceedings of the Joint EDBT/ICDT 2013 Workshops

Self Cite

View full text Add to dashboard Cite

show abstract

“…:SCLC rdfs:subClassOf :Neoplasm . The classification algorithm is based on a variant of graph reachability [45] (a similar procedure was later described in [37]). …”

Section: Answering Sparql Queriesmentioning

confidence: 99%

Ontop: Answering SPARQL queries over relational databases

et al. 2016

View full text Add to dashboard Cite

Abstract. We present Ontop, an open-source Ontology-Based Data Access (OBDA) system that allows for querying relational data sources through a conceptual representation of the domain of interest, provided in terms of an ontology, to which the data sources are mapped. Key features of Ontop are its solid theoretical foundations, a virtual approach to OBDA, which avoids materializing triples and is implemented through the query rewriting technique, extensive optimizations exploiting all elements of the OBDA architecture, its compliance to all relevant W3C recommendations (including SPARQL queries, R2RML mappings, and OWL 2 QL and RDFS ontologies), and its support for all major relational databases.

show abstract

“…Inspired by the work given in [15], [16] and [17], we transform a DL-Lite ontology into a graph. Based on the constructed graph, we can propose our debugging and revision approaches, which will be discussed in the next section.…”

Section: Graph Constructionmentioning

confidence: 99%

Graph-based approaches to debugging and revision of terminologies in DL-Lite

Zhang

et al. 2016

Knowledge-Based Systems

View full text Add to dashboard Cite

In this paper, we deal with the problem of debugging and revision of incoherent terminologies. Ontology debugging aims to provide the explanation of the causes of incoherence and ontology revision aims to eliminate the incoherence. For this purpose, we propose the graph-based approaches to deal with the debugging and revision of terminologies for a family of lightweight ontology languages, DL-Lite. First of all, we transform DL-Lite ontologies to graphs. To deal with the problem of ontology debugging, we calculate the minimal incoherence-preserving subsets (MIPS) of an ontology by computing the minimal incoherence-preserving path-pairs (MIPP) based on the transformed graph. To deal with the problem of ontology revision, we propose the notion of revision state which separates the terminology of an ontology into two disjoint sets: the set of wanted axioms and the set of unwanted axioms. We further define a revision operator based on the revision state. Afterwards, two revision algorithms are proposed to instantiate the revision operator: one is based on a scoring function, and the other one is based on a hitting set tree. We implement these algorithms and conduct experiments of ontology debugging and ontology revision on several adapted real ontologies. The experimental results of ontology debugging show that our approach of calculating MIPS based on graph is efficient and outperforms the state of the art. The experimental results of ontology revision show that the algorithm based on a scoring function is more efficient than the algorithm based on a hitting set tree.

show abstract

Graph-Based Ontology Classification in OWL 2 QL

Cited by 12 publications

References 17 publications

Towards efficient and practical solutions for ontology-based data management

Towards efficient and practical solutions for ontology-based data management

Ontop: Answering SPARQL queries over relational databases

Graph-based approaches to debugging and revision of terminologies in DL-Lite

Contact Info

Product

Resources

About