On the the degree of truth of decidability results for Fuzzy Description Logics
Professor Franz Baader (TU Dresden, Germany)
LOGIC AND COMPUTATION SEMINARDATE: 2012-12-03
TIME: 14:00:00 - 15:00:00
LOCATION: RSISE Seminar Room, ground floor, building 115, cnr. North and Daley Roads, ANU
CONTACT: JavaScript must be enabled to display this email address.
ABSTRACT:
The combination of Fuzzy Logics and Description Logics (DLs) has been investigated for at least two decades because such fuzzy DLs can be used to formalize imprecise concepts. In particular, tableau algorithms for crisp Description Logics have been extended to reason also with their fuzzy counterparts. Recently, it has been shown that, in the presence of general concept inclusion axioms (GCIs), some of these fuzzy DLs actually do not have the finite model property, thus throwing doubt on the correctness of tableau algorithm for which it was claimed that they can handle fuzzy DLs with GCIs. In a series of papers, we have shown that these doubts are indeed justified, by proving that a wide range of fuzzy DLs are actually undecidable in the presence of GCIs.
BIO:
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, ontologies) and automated deduction (term rewriting,
unification theory, combination of decision procedures). He was
program chair of the conferences KI'01, CADE'03, LPAR'04, and
RTA'07, is in the editorial board of several journals in AI and
Logic in Computer Science, has over 160 refereed
articles in major journals and conferences. He is member
of the Academia Europaea and an ECCAI fellow.
