Decidability of Circumscribed Description Logics Revisited

Abstract. We revisit non-monotonic description logics based on circumscription (with preferences) and prove several decidability results for their satisfiability problem. In particular, we consider circumscribed description logics without the finite model property (DL-LiteF and ALCFI) and with fixed roles (DL-LiteF and a fragment of DL-LiteR), improving upon previous decidability results that are limited to logics which have the finite model property and do not allow to fix roles during minimization.

• Type: Journal
• Year: 2015
• Where: BIRTHDAY
• Authors: Piero A. Bonatti, Marco Faella, Carsten Lutz, Luigi Sauro, Frank Wolter
• Keywords: Applied Computing, BIRTHDAY 2015