New semantics for description logic programs enhances efficiency

Researchers have introduced a novel semantics for description logic programs, aiming to enhance computational efficiency and provide a clearer characterization. This new semantics evaluates ontological atoms more strictly, maintaining an NP-complete complexity for consistency problems, unlike the current semantics which can increase to the second level of the polynomial hierarchy. The work also identifies a specific class of description logic programs where the new semantics aligns with the existing one and offers a fixpoint operator and reduct-based transformation for its characterization. AI

IMPACT Introduces a more computationally efficient semantics for logic programming, potentially impacting AI reasoning systems that rely on ontologies and rules.

RANK_REASON Academic paper detailing a new semantics for description logic programs. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.AI →

• alphaXiv
• CatalyzeX Code Finder for Papers
• CORE Recommender
• DagsHub
• Description logic programs
• Electronic Proceedings in Theoretical Computer Science
• Gotit.pub
• Hugging Face
• Influence Flower
• ScienceCast

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →