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

DOI10.1016/J.ARTINT.2023.104034OpenAlexW4387824319MaRDI QIDQ6152660

Franz Baader, Oliver Fernández Gil

Publication date: 13 February 2024

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2023.104034

zbMATH Keywords

computational complexityreasoningdescription logicapproximate concept definitionsconcept measures

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data complexity of query answering in description logics
• Attributive concept descriptions with complements
• Similarity-based relaxed instance queries
• On the decidability status of fuzzy \(\mathcal {A}\mathcal {L}\mathcal {C}\) with general concept inclusions
• HermiT: an OWL 2 reasoner
• Computing the least common subsumer w.r.t. a background terminology
• Making fuzzy description logic more general
• Optimizing terminological reasoning for expressive description logics
• The limits of decidability in fuzzy description logics with general concept inclusions
• Relationships between nondeterministic and deterministic tape complexities
• Terminological reasoning is inherently intractable
• Reasoning with Prototypes in the Description Logic $${\mathcal {ALC}}$$ ALC Using Weighted Tree Automata
• A Framework for Semantic-Based Similarity Measures for $\mathcal{ELH}$ -Concepts
• Adding Threshold Concepts to the Description Logic $\mathcal{EL}$
• An Introduction to Description Logic
• Data Complexity in the $\mathcal{EL}$ Family of Description Logics
• Unification in the Description Logic $\mathcal{EL}$
• Provably Difficult Combinatorial Games
• Deduction in Concept Languages: from Subsumption to Instance Checking
• Personalizing a Concept Similarity Measure in the Description Logic DLELH with Preference Profile
• Automated Reasoning with Analytic Tableaux and Related Methods
• A Logic for Concepts and Similarity
• Fuzzy sets
• Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$
• Non-standard inferences in description logics
• Efficient TBox Reasoning with Value Restrictions using the wer Reasoner

This page was built for publication: Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures