On the capabilities and limitations of OWL regarding typecasting and ontology design pattern views
In ontology engineering, particularly when dealing with heterogeneous domains and their
subfields, legacy data, various data models, existing standards, code lists, and so forth, there …
subfields, legacy data, various data models, existing standards, code lists, and so forth, there …
[PDF][PDF] Finite model reasoning in horn description logics
We study finite model reasoning in expressive Horn description logics (DLs), starting with a
reduction of finite ABox consistency to unrestricted ABox consistency. The reduction relies …
reduction of finite ABox consistency to unrestricted ABox consistency. The reduction relies …
Finite model reasoning in Horn description logics
We study finite model reasoning in expressive Horn description logics (DLs), starting with a
reduction of finite ABox consistency to unrestricted ABox consistency. The reduction relies …
reduction of finite ABox consistency to unrestricted ABox consistency. The reduction relies …
Efficient ontological query answering by rewriting into graph queries
MM Dimartino, A Calì, A Poulovassilis… - Flexible Query Answering …, 2019 - Springer
The OWL 2 QL profile of the OWL 2 Web Ontology Language, based on the family of
description logics called DL-Lite, allows for answering queries by rewriting, ie by …
description logics called DL-Lite, allows for answering queries by rewriting, ie by …
[PDF][PDF] Ontology partitioning using E-Connections revisited
S Jongebloed, T Schneider - MedRACER+ WOMoCoE@ KR, 2018 - jongebloed.me
Modularity of ontologies has received increased attention in the past. For ontologies,
methods for extracting a module and also methods for decomposing an ontology into …
methods for extracting a module and also methods for decomposing an ontology into …
Query Rewriting under Linear Knowledge Bases
MM Dimartino, A Calì, A Poulovassilis… - … Conference on Web …, 2016 - Springer
With the adoption of the recent SPARQL 1.1 standard, RDF databases are capable of
directly answering more expressive queries than simple conjunctive queries. In this paper …
directly answering more expressive queries than simple conjunctive queries. In this paper …
Integrating and querying linked datasets through ontological rules
M Dimartino - 2020 - eprints.bbk.ac.uk
The Web of Linked Open Data has developed from a few datasets in 2007 into a large data
space containing billions of RDF triples published and stored in hundreds of independent …
space containing billions of RDF triples published and stored in hundreds of independent …
Inspecting Java Program States with Semantic Web Technologies
AW Haubner - tuprints.ulb.tu-darmstadt.de
Semantic debugging, as introduced by Kamburjan et al., refers to the practice of applying
technologies of the semantic web to query the run-time state of a program and combine it …
technologies of the semantic web to query the run-time state of a program and combine it …
Event representation and reasoning based on SROIQ and event elements projection
W Liu, N Ding, Y Tan, Y Zhang, Z Liu - Frontier Computing: Theory …, 2016 - Springer
Events have become central elements in the representation of information from various
semantic web applications. It is necessary to develop a formal language for describing and …
semantic web applications. It is necessary to develop a formal language for describing and …
Query Rewriting under Linear SC Knowledge Bases
PT Wood - Web Reasoning and Rule Systems - Springer
With the adoption of the recent SPARQL 1.1 standard, RDF databases are capable of
directly answering more expressive queries than simple conjunctive queries. In this paper …
directly answering more expressive queries than simple conjunctive queries. In this paper …