Revisiting Grounded Circumscription in Description Logics - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2016

Revisiting Grounded Circumscription in Description Logics


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.
Fichier principal
Vignette du fichier
groundedscotland.pdf (432.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-01400068 , version 1 (21-11-2016)



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⟩
175 View
339 Download



Gmail Facebook X LinkedIn More