Ontologies and data management: a brief survey
T Schneider, M Šimkus - KI-Künstliche Intelligenz, 2020 - Springer
Abstract Information systems have to deal with an increasing amount of data that is
heterogeneous, unstructured, or incomplete. In order to align and complete data, systems …
heterogeneous, unstructured, or incomplete. In order to align and complete data, systems …
The Vadalog system: Datalog-based reasoning for knowledge graphs
Over the past years, there has been a resurgence of Datalog-based systems in the database
community as well as in industry. In this context, it has been recognized that to handle the …
community as well as in industry. In this context, it has been recognized that to handle the …
Ontology-mediated query answering with data-tractable description logics
M Bienvenu, M Ortiz - Reasoning Web. Web Logic Rules: 11th …, 2015 - Springer
Recent years have seen an increasing interest in ontology-mediated query answering, in
which the semantic knowledge provided by an ontology is exploited when querying data …
which the semantic knowledge provided by an ontology is exploited when querying data …
Expressive languages for querying the semantic web
The problem of querying RDF data is a central issue for the development of the Semantic
Web. The query language SPARQL has become the standard language for querying RDF …
Web. The query language SPARQL has become the standard language for querying RDF …
Knowledge-based anomaly detection: Survey, challenges, and future directions
Due to the rapidly increasing number of Internet-connected objects, a huge amount of data
is created, stored, and shared. Depending on the use case, this data is visualized, cleaned …
is created, stored, and shared. Depending on the use case, this data is visualized, cleaned …
Chase termination for guarded existential rules
The chase procedure is considered as one of the most fundamental algorithmic tools in
database theory. It has been successfully applied to different database problems such as …
database theory. It has been successfully applied to different database problems such as …
Eliminating harmful joins in warded datalog+/−
We provide a rewriting technique of Warded Datalog+/− settings to sustain decidability and
data tractability of reasoning tasks in the presence of existential quantification and recursion …
data tractability of reasoning tasks in the presence of existential quantification and recursion …
[PDF][PDF] Chasing sets: How to use existential rules for expressive reasoning
D Carral, I Dragoste, M Krötzsch, C Lewe - Description Logics, 2019 - iccl.inf.tu-dresden.de
We propose that modern existential rule reasoners can enable fully declarative
implementations of rule-based inference methods in knowledge representation, in the sense …
implementations of rule-based inference methods in knowledge representation, in the sense …
Expressive languages for querying the semantic web
The problem of querying RDF data is a central issue for the development of the Semantic
Web. The query language SPARQL has become the standard language for querying RDF …
Web. The query language SPARQL has become the standard language for querying RDF …
Existential rule languages with finite chase: Complexity and expressiveness
Finite chase, or alternatively chase termination, is an important condition to ensure the
decidability of existential rule languages. In the past few years, a number of rule languages …
decidability of existential rule languages. In the past few years, a number of rule languages …