Similarity-based relaxed instance queries

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

Rafael Peñaloza, Andreas Ecke, 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 logics; concept similarity measures; instance queries

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

68T30: Knowledge representation

68T37: Reasoning under uncertainty in the context of artificial intelligence

Related Items

Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$, Adding Threshold Concepts to the Description Logic $\mathcal{EL}$

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