Invited speaker

Thomas Meyer
University of Cape Town
Centre for Artificial Intelligence Research
South Africa
Title of the talk:
Abstract:
Preferential Semantics as the Basis for Defeasible
Reasoning in Ontologies
Preferential extensions of classical logics provide a promising foundation on which to base notions of entailment for defeasible reasoning. In this talk I will give an overview of one such a preferential extension, originally proposed by Sarit Kraus, Daniel Lehmann, and Menachem Magidor. This approach has two main advantages. Firstly, it permits a formal analysis of defeasible properties, which plays a central role in assessing how appropriate the obtained results are. And secondly, it allows for decision problems to be reduced to classical entailment checking, sometimes without blowing up the computational complexity with respect to the underlying classical case. The focus of the talk will be on the recent application and extension of this approach to the class of description logics, allowing for the expression of defeasible subsumption, defeasible equivalence, defeasible disjointness, defeasible quantification, and defeasible querying.
Schedule
09:30 - 10:30
11:00 - 11:30
11:30 - 12:00
12:00 - 12:30
14:00 - 14:30
14:30 - 15:00
15:00 - 15:30
16:00 - 16:30
16:30 - 17:00
Thomas Meyer
Invited talk: Preferential Semantics as the Basis for Defeasible Reasoning in Ontologies
Coffee break
Aaron Hunter and Francois Schwarzentruber
Arbitrary Announcements in Propositional Belief Revision
Yuri Santos, Márcio Ribeiro and Renata Wassermann
Between Belief Bases and Belief Sets: Partial Meet Contraction
Guillaume Aucher
When Conditional Logic and Belief Revision Meet Substructural Logics
Lunch break
Raphael Cobe and Renata Wassermann
Ontology Repair Through Partial Meet Contraction
Szymon Klarman and Katarina Britz
Towards Unsupervised Ontology Learning from Data
Loizos Michael
Jumping to Conclusions
Coffee break
Petr Homola
Natural Language Understanding as First-Order Abduction via Stable Models
Roxane Koitz and Franz Wotawa
Finding Explanations: an Empirical Evaluation of Abductive Diagnosis Algorithms
Note: Each presentation should be 25min long, with 5min of the slot reserved for Q&A.