Learning explanatory rules from noisy data

R Evans, E Grefenstette - Journal of Artificial Intelligence Research, 2018 - jair.org
Artificial Neural Networks are powerful function approximators capable of modelling
solutions to a wide variety of problems, both supervised and unsupervised. As their size and …

[BOOK][B] Introduction to description logic

F Baader, I Horrocks, C Lutz, U Sattler - 2017 - books.google.com
Description logics (DLs) have a long tradition in computer science and knowledge
representation, being designed so that domain knowledge can be described and so that …

Swift Logic for Big Data and Knowledge Graphs: Overview of Requirements, Language, and System

L Bellomarini, G Gottlob, A Pieris… - SOFSEM 2018: Theory and …, 2018 - Springer
Many modern companies wish to maintain knowledge in the form of a corporate knowledge
graph and to use and manage this knowledge via a knowledge graph management system …

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 …

Taming the infinite chase: Query answering under expressive relational constraints

A Calì, G Gottlob, M Kifer - Journal of Artificial Intelligence Research, 2013 - jair.org
The chase algorithm is a fundamental tool for query evaluation and for testing query
containment under tuple-generating dependencies (TGDs) and equality-generating …

On rules with existential variables: Walking the decidability line

JF Baget, M Leclère, ML Mugnier, E Salvat - Artificial Intelligence, 2011 - Elsevier
We consider positive rules in which the conclusion may contain existentially quantified
variables, which makes reasoning tasks (such as conjunctive query answering or …

Data complexity of query answering in description logics

D Calvanese, G De Giacomo, D Lembo, M Lenzerini… - Artificial Intelligence, 2013 - Elsevier
In this paper we study data complexity of answering conjunctive queries over description
logic (DL) knowledge bases constituted by a TBox and an ABox. In particular, we are …

The Vadalog system: Datalog-based reasoning for knowledge graphs

L Bellomarini, G Gottlob, E Sallinger - arxiv preprint arxiv:1807.08709, 2018 - arxiv.org
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 …

Towards more expressive ontology languages: The query answering problem

A Calì, G Gottlob, A Pieris - Artificial Intelligence, 2012 - Elsevier
Ontology reasoning finds a relevant application in the so-called ontology-based data
access, where a classical extensional database (EDB) is enhanced by an ontology, in the …

Ontology-based data access: A study through disjunctive datalog, CSP, and MMSNP

M Bienvenu, BT Cate, C Lutz, F Wolter - ACM Transactions on Database …, 2014 - dl.acm.org
Ontology-based data access is concerned with querying incomplete data sources in the
presence of domain-specific knowledge provided by an ontology. A central notion in this …