Circumscribing DL-Lite

Proc. of the ECAI 2012 Workshop on Belief Change, Non-Monotonic Reasoning and Conflict resolution (BNC@ECAI 2012). 2012.

Classical logics (and hence Description Logics) are monotonic: the set of conclusions increases monotonically with the set of premises. Instead, common-sense reasoning is characterized as non-monotonic: new information can invalidate some of the previously made conclusions. Circumscription is one of the main non-monotonic formalisms whose idea is to minimize (circumscribe) the extension of given predicates. In this paper we study circumscribed DL-Lite knowledge bases and show how to compute circumscription of a single predicate (either a concept or a role) in a DL-Litebool H knowledge base. Unlike other works on circumscribed Description Logics KBs, we are interested not only in checking entailment, but actually in computing circumscription itself. We show that circumscription of a role in DL-Litebool H requires the language of ALCHOIQ extended with union or roles, thus is first-order expressible.

@inproceedings{BNC-2012,
   title = "Circumscribing DL-Lite",
   year = "2012",
   author = "Elena Botoeva and Diego Calvanese",
   booktitle = "Proc. of the ECAI 2012 Workshop on Belief Change,
Non-Monotonic Reasoning and Conflict resolution (BNC@ECAI 2012)",
}