Answering Instance Queries Relaxed by Concept Similarity

Andreas EckeAndreas Ecke, Rafael PeñalozaRafael Peñaloza, Anni-Yasmin TurhanAnni-Yasmin Turhan

Download

Andreas Ecke, Rafael Peñaloza, Anni-Yasmin Turhan
Answering Instance Queries Relaxed by Concept Similarity
In Chitta Baral and Giuseppe De Giacomo and Thomas Eiter, eds., Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning (KR'14), 248-257, 2014. AAAI Press

Details
Bibtex

KurzfassungAbstract
In Description Logics (DL) knowledge bases (KBs) information is typically captured by crisp concepts. For many applications querying the KB by crisp query concepts is too restrictive. A controlled way of gradually relaxing a query concept can be achieved by the use of concept similarity. In this paper we formalize the task of instance query answering for crisp DL KBs using concepts relaxed by concept similarity measures (CSM). For the DL $mathcal{EL}$ we investigate computation algorithms for this task, their complexity and properties for the employed CSM in case unfoldabel Tboxes or general TBoxes aer used.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ EcPeTu-KR14,
  address = {Vienna, Austria},
  author = {Andreas {Ecke} and Rafael {Pe{\~n}aloza} and Anni-Yasmin {Turhan}},
  booktitle = {Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning ({KR'14})},
  editor = {Chitta {Baral} and Giuseppe {De Giacomo} and Thomas {Eiter}},
  pages = {248--257},
  publisher = {AAAI Press},
  title = {Answering Instance Queries Relaxed by Concept Similarity},
  year = {2014},
}