Tractable Reasoning and Conjunctive Query Answering for Defeasible DL-Lite under Rational Closure

• URL: http://arxiv.org/abs/2606.24279v1
• Date: Tue, 23 Jun 2026 08:02:07 GMT
• Title: Tractable Reasoning and Conjunctive Query Answering for Defeasible DL-Lite under Rational Closure
• Abstract summary: We study the application of Rational Closure (RC) to the core and horn variants of the DL-Lite family of lightweight description logics.<n>Our main contribution is providing a plug-in architecture that builds upon existing standard classical reasoners.
• Score: 0.5156484100374058
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• A Horn extension of DL-Lite with NL data complexity [1.376408511310322]
  We introduce a description logic that strictly extends the core DL-Lite, supports reachability restricted conjunction, and allows for reasoning in NL.<n>We establish the NL via a rewriting into two-way regular path queries, providing initial evidence that our language is a promising candidate for extending OMQA to graph query languages.
  arXiv  Detail & Related papers  (2026-05-13T11:26:32Z)
• KBQA-R1: Reinforcing Large Language Models for Knowledge Base Question Answering [64.62317305868264]
  We present textbfKBQA-R1, a framework that shifts the paradigm from text imitation to interaction optimization via Reinforcement Learning.<n>Treating KBQA as a multi-turn decision process, our model learns to navigate the knowledge base using a list of actions.<n>Experiments on WebQSP, GrailQA, and GraphQuestions demonstrate that KBQA-R1 achieves state-of-the-art performance.
  arXiv  Detail & Related papers  (2025-12-10T17:45:42Z)
• Don't "Overthink" Passage Reranking: Is Reasoning Truly Necessary? [60.725923225442095]
  We compare reasoning-based pointwise rerankers (ReasonRR) to standard, non-reasoning pointwise rerankers (StandardRR) under identical training conditions.<n>We find that ReasonRR-NoReason is surprisingly more effective than ReasonRR.
  arXiv  Detail & Related papers  (2025-05-22T16:41:37Z)
• LaRS: Latent Reasoning Skills for Chain-of-Thought Reasoning [61.7853049843921]
  Chain-of-thought (CoT) prompting is a popular in-context learning approach for large language models (LLMs)<n>This paper introduces a new approach named Latent Reasoning Skills (LaRS) that employs unsupervised learning to create a latent space representation of rationales.
  arXiv  Detail & Related papers  (2023-12-07T20:36:10Z)
• Querying Circumscribed Description Logic Knowledge Bases [9.526604375441073]
  Circumscription is one of the main approaches for defining non-monotonic description logics. We prove decidability of (U)CQ evaluation on circumscribed DL KBs. We also study the much simpler atomic queries (AQs)
  arXiv  Detail & Related papers  (2023-06-07T15:50:15Z)
• Complex Query Answering on Eventuality Knowledge Graph with Implicit Logical Constraints [48.831178420807646]
  We propose a new framework to leverage neural methods to answer complex logical queries based on an EVentuality-centric KG. Complex Eventuality Query Answering (CEQA) considers the implicit logical constraints governing the temporal order and occurrence of eventualities. We also propose a Memory-Enhanced Query (MEQE) to significantly improve the performance of state-of-the-art neural query encoders on the CEQA task.
  arXiv  Detail & Related papers  (2023-05-30T14:29:24Z)
• An Extensible Logic Embedding Tool for Lightweight Non-Classical Reasoning [91.3755431537592]
  The logic embedding tool provides a procedural encoding for non-classical reasoning problems into classical higher-order logic. It can support an increasing number of different non-classical logics as reasoning targets.
  arXiv  Detail & Related papers  (2022-03-23T12:08:51Z)
• Expressivity of Planning with Horn Description Logic Ontologies (Technical Report) [12.448670165713652]
  We address open-world state constraints formalized by planning over a description logic (DL) ontology. We propose a novel compilation scheme into standard PDDL with derived predicates. We show that our approach can outperform previous work on existing benchmarks for planning with DL.
  arXiv  Detail & Related papers  (2022-03-17T14:50:06Z)
• Causal Inference Principles for Reasoning about Commonsense Causality [93.19149325083968]
  Commonsense causality reasoning aims at identifying plausible causes and effects in natural language descriptions that are deemed reasonable by an average person. Existing work usually relies on deep language models wholeheartedly, and is potentially susceptible to confounding co-occurrences. Motivated by classical causal principles, we articulate the central question of CCR and draw parallels between human subjects in observational studies and natural languages. We propose a novel framework, ROCK, to Reason O(A)bout Commonsense K(C)ausality, which utilizes temporal signals as incidental supervision.
  arXiv  Detail & Related papers  (2022-01-31T06:12:39Z)
• Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures [13.245718532835864]
  Contextualized Knowledge Repository (CKR) is rooted in description logics but links on the reasoning side strongly to logic programs. We present a generalization of CKR hierarchies to multiple contextual relations, along with their interpretation of defeasible axioms and preference. We show that for a relevant fragment of CKR hierarchies with multiple contextual relations, query answering can be realized with the popular asprin framework.
  arXiv  Detail & Related papers  (2021-08-06T13:06:45Z)
• Reasoning on $\ extit{DL-Lite}_{\cal R}$ with Defeasibility in ASP [16.79080135184303]
  We provide a definition for $textitDL-Lite_cal R$ knowledge bases with defeasible axioms and study their semantic and computational properties. The limited form of $textitDL-Lite_cal R$ axioms allows us to formulate a simpler ASP encoding, where reasoning on negative information is managed by direct rules.
  arXiv  Detail & Related papers  (2021-06-28T15:23:11Z)
• CQE in Description Logics Through Instance Indistinguishability (extended version) [0.0]
  We study privacy-preserving query answering in Description Logics (DLs) We derive data complexity results query answering over DL-Lite$_mathcal$$. We identify a semantically well-founded notion of approximated confidentiality answering for CQE.
  arXiv  Detail & Related papers  (2020-04-24T17:28:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.