Skip to Main content Skip to Navigation
Conference papers

Revisiting Grounded Circumscription in Description Logics

Stathis Delivorias 1 Sebastian Rudolph 2
1 GRAPHIK - Graphs for Inferences on Knowledge
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
2 International Center For Computational Logic [TU Dresden]
Institute of Artificial Intelligence [Dresden]
Abstract : Circumscription is a paradigm of non-monotonic logic meant to formalize the common-sense understanding that, among competing theories that represent phenomena equally well, the one with the fewest “abnormal” assumptions should be selected. Several papers have considered ways of adding circumscription to Description Logics. One of the proposals with good computational properties is Grounded Circumscription, introduced by Sengupta, Krishnadi and Hitzler in 2011. Our paper builds on their general idea, but identifies some problems with the original semantics definition, which gives rise to counter-intuitive consequences and renders the proposed tableau algorithm incorrect. We give an example that makes the problem explicit and propose a modification of the semantics that remedies this issue. On the algorithmic side, we show that a big part of the reasoning can actually be transferred to standard Description Logics, for which tools and results already exist.
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Stathis Delivorias <>
Submitted on : Monday, November 21, 2016 - 5:51:38 PM
Last modification on : Thursday, January 7, 2021 - 2:30:03 PM


Files produced by the author(s)




Stathis Delivorias, Sebastian Rudolph. Revisiting Grounded Circumscription in Description Logics. RR: Web Reasoning and Rule Systems, Sep 2016, Aberdeen, United Kingdom. pp.46-60, ⟨10.1007/978-3-319-45276-0_5⟩. ⟨lirmm-01400068⟩



Record views


Files downloads