Skip to content

Share
Share

Event Details

Event:
Approximately description logics
Date:
29 March 2017 at 2:00 pm – 29 March 2017 at 3:00 pm
Venue:
Room G12A, 14 Rainforest Walk, Clayton

Description

Presenter: Professor Franz Baader

Professor Franz BaaderProfessor Franz Baader

Abstract:

Description Logics (DLs) are a well-investigated family of logic-based knowledge representation languages, which are, e.g., frequently used to formalize ontologies for application domains such as biology and medicine. To define the important notions of such an applicationd domain as formal  concepts, DLs state necessary and sufficient conditions for an individual to belong to a concept. Since traditional DLs are based on classical first-order logic, their semantics is strict in the sense that all the stated properties need to be satisfied for an individual to belong to a concept. In applications  where exact definitions are hard to come by, it would be useful to relax this strict requirement and allow for approximate definitions of concepts, where most, but not all, of the stated properties are required to hold.

In order to allow for approximate definitions of concepts, we have introduced the notion of a graded membership function, which instead of a Boolean membership value 0 or 1 yields a membership degree from the interval [0,1] expressing the degree to which the individual belongs to the concept. Threshold concepts  then collect all the individuals that belong to C with degree at least or at most a value from [0,1]. In addition to determining the complexity of reasoning in an extension of the well-known DL EL by such threshold concepts w.r.t. a fixed graded membership function deg, we have also investigated how  such functions can be defined using similarity measures on concepts. Finally, we have shown that weighted tree automata can be used to define similarity measures and thus graded membership function.

(This is joint work with Gerhard Brewka, Oliver Fernández Gil, and Pavlos Marantidis.)

Biography:

Professor Franz Baader is full professor for Theoretical Computer Science at TU Dresden, Germany. He has obtained his PhD in Computer Science at the University of Erlangen, Germany. He was senior researcher at the German Research Institute  for Artificial Intelligence (DFKI) for four years, and associate professor at RWTH Aachen for eight years. His main research area is Logic in Computer Science, in particular knowledge representation (description logics, modal logics, nonmonotonic logics) and automated deduction (term rewriting, unification  theory, combination of decision procedures).


Event Contact

Name
Yuan-Fang Li
E-Mail
YuanFang.Li@monash.edu