Similarity-based relaxed instance queries
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- A Framework for Semantic-Based Similarity Measures for $\mathcal{ELH}$ -Concepts
- A tableau algorithm for reasoning about concepts and similarity
- Deciding inseparability and conservative extensions in the description logic
- Description Logics
- How fuzzy is my fuzzy description logic?
- Hypertableau reasoning for description logics
- On the (un)decidability of fuzzy description logics under Łukasiewicz t-norm
- Towards Top-k Query Answering in Description Logics: The Case of DL-Lite
Cited in
(3)- Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures
- Adding threshold concepts to the description logic \(\mathcal{EL}\)
- Approximation in description logics: how weighted tree automata can help to define the required concept comparison measures in \(\mathcal {FL}_0\)
This page was built for publication: Similarity-based relaxed instance queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q901081)