Distinguishing Answers in Conceptual Graph Knowledge Bases - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2009

Distinguishing Answers in Conceptual Graph Knowledge Bases


In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers are comparable. In this paper we define a framework to distinguish amongst answers. Our method will be based on adding contextual knowledge extracted from the KB. The construction of such descriptions allows the clarification of the notion of redundancy between answers, not only based on the images of the requested pattern but on the whole KB. We propose a definition for the set of answers to be computed from a query, which ensures both properties of non-redundancy and completeness. While all answers of this set can be distinguished from others with a description, an open question remains of what is a good description to return to an end-user. We introduce the notion of smart answer and give an algorithm that computes a set of smart answers, based on a vertex neighborhood distance.
Fichier principal
Vignette du fichier
iccs09.pdf (170.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00374749 , version 1 (09-04-2009)



Nicolas Moreau, Michel Leclère, Madalina Croitoru. Distinguishing Answers in Conceptual Graph Knowledge Bases. ICCS: International Conference on Conceptual Structures, Jul 2009, Moscow, Russia. pp.233-246, ⟨10.1007/978-3-642-03079-6_18⟩. ⟨lirmm-00374749⟩
291 View
250 Download



Gmail Facebook X LinkedIn More