Tractable Reasoning and Conjunctive Query Answering for Defeasible DL-Lite under Rational Closure
Summary
This paper studies rational closure for the DL-Lite family of description logics, providing a plug-in architecture for efficient non-monotonic reasoning and conjunctive query answering with minimal computational overhead.
View Cached Full Text
Cached at: 06/24/26, 07:46 AM
# Tractable Reasoning and Conjunctive Query Answering for Defeasible DL-Lite under Rational Closure Source: [https://arxiv.org/abs/2606.24279](https://arxiv.org/abs/2606.24279) [View PDF](https://arxiv.org/pdf/2606.24279) > 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\. ## Submission history From: Giovanni Casini \[[view email](https://arxiv.org/show-email/e7d18828/2606.24279)\] **\[v1\]**Tue, 23 Jun 2026 08:02:07 UTC \(672 KB\)
Similar Articles
Tractable Query Answering under Epistemic Confidentiality Policies in DL Ontologies (extended version)
This paper studies Controlled Query Evaluation (CQE) for Description Logic ontologies with epistemic dependency policies, introducing a new semantics based on minimal policy violation that achieves polynomial-time query answering for DL-Lite ontologies.
A*-Thought-V2: Efficient Latent Reasoning via Geometric Dynamics of LLM
A*-Thought-V2 models chain-of-thought reasoning as hidden-state trajectories, using geometric dynamics to compress non-essential steps into latent tokens, improving accuracy and efficiency in LLM reasoning.
When Absence Is Evidence: Evaluating Completeness-Sensitive Negative Reasoning in Large Language Models
Introduces CROWN-QA, a benchmark for completeness-sensitive negative reasoning in LLMs, showing models struggle to distinguish justified negative answers from insufficient evidence, often over-closing.
DAIS: Dependency-Aware Intermediate QA Supervision for Complex Reasoning
Introduces DAIS, a training-time framework that converts chain-of-thought rationales into dependency-conditioned intermediate QA records to provide better supervision for complex reasoning. Achieves up to 5.6% accuracy improvement over baselines on policy-compliance benchmarks.
Structural Rationale Distillation via Reasoning Space Compression
This paper proposes D-RPC, a method for distilling reasoning from large language models to smaller ones by compressing reasoning paths into a reusable bank, achieving better performance and consistency on math and commonsense benchmarks.