TUD Logo

TUD Home » ... » Teaching » Winter Term 2013-14 » Existential Rules

Computational Logic

Existential Rules

Winter Term 2013/14

Course Description

The course focuses on a problem called ontology based data access (OBDA), which consists in querying data while taking general domain knowledge (an ontology) into account. The ontology is assumed to be expressed via a set of existential rules in this course. After introducing the problem, we will present classical approaches to solve it and their limits. More technical material will be covered towards later in the course. At the end of the course, the students are expected to have a clear idea of what the questions relevant to OBDA that have been studied in the literature are, and to be able to understand research papers on the topic.

Lecturer:  Michaël Thomazo


Status:  advanced unit

SWS (lecture/tutorial/practical):  2/2/0

Examination method:  to be announced


  • familiarity with first-order logic


The first lecture will be on Friday, 18th October 2013, 13:00-14:30 (DS 4) in room INF E005.
There is no lecture and no tutorial on Friday, 25th October 2013.

The lecture is scheduled for Friday, 13:00-14:30 (DS 4) in room INF E005.
The tutorial is scheduled for Friday, 14:50-16:20 (DS 5) in room INF E005.

Handouts and Slides


  • A. Calì, G. Gottlob et T. Lukasiewicz : A general datalog-based framework for tractable query answering over ontologies. J. Web Sem., 14, 2012
  • D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini et R. Rosati. Dl-Lite: Tractable description logics for ontologies. In AAAI, pages 602-607, 2005
  • M.-L. Mugnier: Ontological Query Answering with Existential Rules. RR 2011: 2-23
  • M. Thomazo, Conjunctive Query Answering under Decidable Rules, Ph.D. Thesis
Last modified: 29th Nov 2013, 12.26 PM
Author: Dr. Sarah Gaggl