Chapter

Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation

Volume 9060 of the series Lecture Notes in Computer Science pp 112-124

Decidability of Circumscribed Description Logics Revisited

  • Piero BonattiAffiliated withDept. of Electrical Engineering and Information Technologies, University of Naples
  • , Marco FaellaAffiliated withDept. of Electrical Engineering and Information Technologies, University of Naples
  • , Carsten LutzAffiliated withDept. of Computer Science, University of Bremen
  • , Luigi SauroAffiliated withDept. of Electrical Engineering and Information Technologies, University of Naples
  • , Frank WolterAffiliated withDept. of Computer Science, University of Liverpool

* Final gross prices may vary according to local VAT.

Get Access

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-Lite\(_{\mathcal{F}}\) and \(\mathcal{ALCFI}\)) and with fixed roles (DL-Lite\(_{\mathcal{F}}\) and a fragment of DL-Lite\(_{\mathcal{R}}\)), 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.