Description logics with aggregates and concrete domains

Franz Baader, Ulrike Sattler
2003 Information Systems  
We show that extending description logics by simple aggregation functions as available in database systems may lead to undecidability of inference problems such as satis ability and subsumption. De nition 1 A concrete domain D = (dom(D); pred(D)) consists of
doi:10.1016/s0306-4379(03)00003-6 fatcat:3sjoby7fl5f7xow3boe2lsfxre