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

2026-06-23 · Source: Artificial Intelligence · Field: Technology & Digital — Artificial Intelligence & Machine Learning · Depth: Expert, quick

Summary

This research investigates the application of Rational Closure (RC), a widely accepted non-monotonic formalism, to the core and horn variants of the DL-Lite family of lightweight description logics. The study specifically analyzes both entitlement (instance checking) and Conjunctive Query (CQ) answering under RC. A key contribution is the development of a plug-in architecture that leverages existing standard classical reasoners. This architecture demonstrates that reasoning and CQ answering under RC for DL-Lite can be performed efficiently with minimal computational overhead, offering a practical approach to handling defeasible knowledge in these logic systems.

Key takeaway

For AI Scientists working with Description Logics and defeasible knowledge, this research indicates a viable path to efficient non-monotonic reasoning. You should consider exploring the proposed plug-in architecture, which integrates with standard classical reasoners, to achieve tractable entitlement and Conjunctive Query answering in DL-Lite systems. This approach minimizes computational overhead, allowing for more practical deployment of advanced logical reasoning capabilities in your applications.

Key insights

Rational Closure applied to DL-Lite enables efficient non-monotonic reasoning and conjunctive query answering.

Principles

• Rational Closure (RC) is a well-established non-monotonic formalism for defeasible knowledge.
• Efficient reasoning and CQ answering for DL-Lite under RC is achievable with minimal overhead.

Method

A plug-in architecture is proposed that builds upon existing standard classical reasoners to implement RC for DL-Lite.

In practice

• Efficiently perform instance checking (entitlement) in DL-Lite systems.
• Efficiently perform Conjunctive Query (CQ) answering in DL-Lite systems.

Topics

• Description Logics
• Rational Closure
• DL-Lite
• Non-monotonic Reasoning
• Conjunctive Query Answering
• Tractable Reasoning

Best for: Research Scientist, AI Scientist

Related on AIssential

• Tractable Reasoning and Conjunctive Query Answering for Defeasible DL-Lite under Rational Closure — A plug-in architecture enables efficient defeasible reasoning and CQ answering for DL-Lite under Rational Closure.
• Abstractions of Queries in Ontology-Based Data Access — The paper extends UCQs to express complete query abstractions in OBDA without increasing complexity.
• BiCon-Gate: Consistency-Gated De-colloquialisation for Dialogue Fact-Checking — BiCon-Gate improves dialogue fact-checking by consistently de-colloquializing claims with contextual semantic gating.
• Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic — Extending non-monotonic rational entailment to PDSL via situated conditionals allows faithful translation and preserves complexity bounds for inference.
• Plausible Reasoning and First-Order Plausible Logic — Plausible Logic offers a non-numeric, first-order framework for reasoning with defeasible statements and managing ambiguity.
• Exact Structural Abstraction and Tractability Limits — Exact relevance certification lacks a finite, structural tractability classifier due to maximal optimizer-quotient realizability and closure-law invariance.

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by Artificial Intelligence.