Logical and computational properties of the description logic MIRTL

In recent years a number of positive (i.e. tractability and decidability) results have been found concerning the computational complexity of Description Logics (DLs) Unfortunately, also negative results have appeared which show that some DLs (e.g NIKL and KL-ONE) are undecidable. This work contributes to this latter literature by showing an undecidability result for another DL (called MIRTL) which had not been previously studied from the standpoint of computational complexity and which is not directly related to the ones already shown undecidable.