FAIR 2015

2015 Forum for Artificial Intelligence Research Workshop

30 March - 2 April 2015, University of Cape Town - South Africa

Home Registration Invited Speakers Programme

Programme


The University of Cape Town



30 March

09:00 – 12:30 Uli Sattler Understanding the Complexity of Description Logic Reasoning: Worst Case and Beyond (short course) - Part 1
14:00 – 14:30 Zubeida C. Khan Feasibility of automated foundational ontology interchangeability

14:30 – 15:00 Catherine Chavula Multilingual ontologies using African languages

15:00 – 15:30 Coffee break

15:30 – 16:00 Nasubo Ongoma Temporal attributes: Status and subsumption

16:00 – 16:30 Henriette Harmse Scenario testing using OWL

16:30 – 16:50 Nishal Morar Extending classical reasoning for taxonomic classification queries over ontologies

31 March

09:00 – 12:30 Uli Sattler Understanding the Complexity of Description Logic Reasoning: Worst Case and Beyond (short course) - Part 2
14:00 – 17:00 David Toman Logic for Database Systems Implementation (or Life beyond Lite Logics and CQ/UCQ) (tutorial)

1 April

09:00 – 12:30 Uli Sattler Understanding the Complexity of Description Logic Reasoning: Worst Case and Beyond (short course) - Part 3
14:00 – 14:30 Gavin Rens A New Approach to Probabilistic Belief Change

14:30 – 15:00 Kody Moodley Practical defeasible reasoning for description logics

15:00 – 15:30 Coffee break

15:30 – 16:00 Maria Keet A core ontology of macroscopic stuff

16:00 – 16:30 Aurona Gerber Data Science research at CAIR

16:30 – 16:50 TBA


2 April

09:00 – 12:30 Uli Sattler Understanding the Complexity of Description Logic Reasoning: Worst Case and Beyond (short course) - Part 4
12:30 – 17:00 Social event Outing to Kirstenbosch Botanical Gardens

Topic Descriptions

Understanding the Complexity of Description Logic Reasoning: Worst Case and Beyond by Uli Sattler

In this tutorial, we are going to look closely at the complexity of Description Logic (DL) reasoning. After a brief introduction to DLs and associated reasoning problems, we will review their computational worst case complexity and discuss various sources of this complexity. We will then relate all this to reasoner performance in practice and discuss various associated phenomena, in particular performance robustness. Finally, we will look into cognitive complexity, i.e., approaches to measuring how difficult reasoning is for humans, and into areas where such measurements are relevant.

Logic for Database Systems Implementation (or Life beyond Lite Logics and CQ/UCQ) by David Toman

The paradigm of ontology-based data access (OBDA) has recently emerged as an exciting application of knowledge representation and reasoning technologies in information systems. In a nutshell, the underlying idea is to facilitate high-level access to data by separating the user from the raw data using an ontology that provides a user-oriented "semantic" view of the data and makes it accessible via queries formulated solely in the language of the ontology without any knowledge of the actual structure of the data (this property is commonly called "physical data independence" in database literature).

The tutorial will present an overview of current approaches to OBDA and study the similarities (and differences) between OBDA and various approaches to logical and physical design in the relational model. In particular the lectures will focus on showing how advanced knowledge representation techniques accompanied by powerful reasoning algorithms and strategies yield a novel approach to the problem of answering queries formulated over a conceptual (logical) representation of knowledge by "compiling" them to efficient algorithms operating over a physical representation of the knowledge (i.e., over a choice of particular data structures). Such an approach allows applying KR technology in non-traditional settings, such as main-memory databases and embedded systems, settings in which our solutions must be competitive with hand-crafted C code in performance.

In part, the lectures will be based on "David Toman, Grant E. Weddell: Fundamentals of Physical Design and Query Compilation. Synthesis Lectures on Data Management, Morgan & Claypool Publishers 2011".

The outline for the tutorial:

  1. Introduction Goals and Current Practice.
  2. Standard OBDA approaches: Conjunctive Queries and Lite Logics.
  3. Physical Design and Schema Languages.
  4. How do we execute queries? How do we update data?
  5. Open Issues