A New Well-Supported Semantics for Description Logic Programs

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

Summary

A new well-supported semantics for Description Logic Programs (DL programs) has been introduced to address limitations in the existing semantics. DL programs combine rules with ontologies, and well-supported semantics prevent answer sets from relying on cyclic dependencies. The prior well-supported semantics suffered from increased computational complexity for its consistency problem and lacked a reduct transformation characterization. The proposed new semantics evaluates ontological atoms more strictly, maintaining the consistency problem's complexity at NP-complete, rather than elevating it to the second level of the polynomial hierarchy. This work also identifies a specific syntactic class of DL programs where the new semantics is equivalent to the current one. Characterized by a fixpoint operator and a reduct-based transformation, this new semantics is a strict subset of the current well-supported semantics, preserving the original notion while introducing a stricter variant preferred for its alignment with logic programming.

Key takeaway

For AI scientists developing or evaluating Description Logic Programs, you should consider this new well-supported semantics. It offers a consistency problem that remains NP-complete, avoiding the higher computational complexity of previous approaches. This stricter evaluation of ontological atoms, characterized by a fixpoint operator and reduct transformation, provides a more robust and computationally efficient foundation for integrating rules with ontologies in your systems.

Key insights

The new semantics for Description Logic Programs offers reduced computational complexity and a clear characterization, improving upon prior well-supported semantics.

Principles

• Well-supportedness prevents cyclic dependencies.
• Stricter evaluation can reduce complexity.
• Reduct transformations characterize semantics.

Method

The new semantics is characterized using a fixpoint operator and a reduct-based transformation, evaluating ontological atoms more strictly than the current approach.

Topics

• Description Logic Programs
• Well-supported Semantics
• Ontologies
• Logic Programming
• Computational Complexity
• Reduct Transformation

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.
• OntoLearner: A Modular Python Library for Ontology Learning with Large Language Models — Ontology learning's primary bottleneck is ontological complexity, not LLM capability or size.
• Ontologies, Misunderstood — Ontologies reason over abstract forms and class relationships, distinct from data-centric relational logic.
• Theorem-Grounded Execution Ontologies for Interpretable Machine Reasoning — TGEO models LLM reasoning as an executable state-transition process for enhanced interpretability and verifiability.
• Off the Edge of the Map — Conflating absence of data with negative claims (CWA) in open-world systems leads to false conclusions.
• The Semantics of Semantics — The data industry's "semantic layer" primarily offers SQL abstraction and metric governance, not formal semantic reasoning.

See Counsel's argued verdicts on the open AI decisions leaders are weighing →

Open in AIssential →

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