Tractable Reasoning and Conjunctive Query Answering for Defeasible DL-Lite under Rational Closure
Giovanni Casini, Umberto Straccia
cs.AI
Abstract
In Description Logics (DLs), reasoning under Rational Closure (RC) is a well-known and widely accepted non-monotonic formalism to handle defeasible knowledge. In this paper, we study the application of RC to the core and horn variants of the DL-Lite family of lightweight description logics. We analyze both entitlement (instance checking) and Conjunctive Query (CQ) answering under RC. Our main contribution is providing a plug-in architecture that builds upon existing standard classical reasoners, establishing that reasoning and CQ answering under RC for DL-Lite can be done efficiently with minimal computational overhead.
Topics
Classified with taxonomy v2 on Wed, 2 Sept 2026.