Similarity-based relaxed instance queries

DOI10.1016/j.jal.2015.01.002zbMath1386.68165OpenAlexW2046601421MaRDI QIDQ901081

Andreas Ecke, Rafael Peñaloza, Anni-Yasmin Turhan

Publication date: 23 December 2015

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2015.01.002

zbMATH Keywords

description logicsconcept similarity measuresinstance queries

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (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$$

Uses Software

• Racer
• RacerPro
• ELK

Cites Work

• Unnamed Item
• Deciding inseparability and conservative extensions in the description logic
• On the (un)decidability of fuzzy description logics under Łukasiewicz t-norm
• How Fuzzy Is My Fuzzy Description Logic?
• A Framework for Semantic-Based Similarity Measures for $\mathcal{ELH}$ -Concepts
• Towards Top-k Query Answering in Description Logics: The Case of DL-Lite
• Description Logics
• Hypertableau Reasoning for Description Logics
• Automated Reasoning with Analytic Tableaux and Related Methods

This page was built for publication: Similarity-based relaxed instance queries