Efficient TBox Reasoning with Value Restrictions using the wer Reasoner

DOI10.1017/s1471068421000466zbMath1530.68243arXiv2107.12877OpenAlexW3207176796MaRDI QIDQ6063879

Anni-Yasmin Turhan, Patrick Koopmann, Franz Baader, Unnamed Author, Benjamin Zarrieß

Publication date: 12 December 2023

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.12877

zbMATH Keywords

reasoningdescription logicssubsumption

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (1)

Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures

Cites Work

• Unnamed Item
• Unnamed Item
• The KL-ONE family
• The OWL reasoner evaluation (ORE) 2015 competition report
• Terminological reasoning is inherently intractable
• Approximate Unification in the Description Logic $$\mathcal {FL}_0$$
• Complexities of Horn Description Logics
• An Introduction to Description Logic
• Matching in the Description Logic FL0 with respect to General TBoxes
• An overview of tableau algorithms for description logics

This page was built for publication: Efficient TBox Reasoning with Value Restrictions using the wer Reasoner