Skip to main content

Circumscribing DL-Lite

Botoeva, Elena, Calvanese, Diego (2012) Circumscribing DL-Lite. In: Proceedings of the ECAI 2012 Workshop on Belief Change, Non-Monotonic Reasoning and Conflict resolution (BNC@ECAI~2012). . pp. 7-13. IOS Press (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:91333)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL
https://hdl.handle.net/10863/5671

Abstract

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 nonmonotonic 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-LiteH bool 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-LiteH bool requires the language of ALCHOIQ extended with union or roles, thus is first-order expressible.

Item Type: Conference or workshop item (Paper)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Amy Boaler
Date Deposited: 04 Nov 2021 13:00 UTC
Last Modified: 16 Nov 2021 10:27 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/91333 (The current URI for this page, for reference purposes)
  • Depositors only (login required):