New automata approach achieves EXPTIME for description logics

This research paper introduces an automata-based approach to analyze description logics with concrete domains, aiming to determine the decidability and complexity of consistency problems. The proposed method enriches transitions with symbolic constraints, achieving an optimal upper bound of EXPTIME for the non-emptiness problem under specific concrete domain properties. The authors demonstrate that this approach can be extended to include features like inverse roles and functional role names while maintaining EXPTIME-membership, highlighting the robustness of constraint automata. AI

IMPACT This research contributes to the theoretical foundations of knowledge representation and reasoning, potentially impacting future AI systems that rely on complex logical structures.

RANK_REASON The cluster contains an academic paper detailing a new theoretical approach in computer science. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.AI →

• arXiv
• Concrete Domains
• Constraint Automata
• description logic
• EXPTIME
• Stéphane Demri

• paper
• other

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