SPARQL Query Language for RDF Data: Answers Q(B), distinguished answers D, a distance k Result: A set D ? of distinguished answers at distance k begin D ? ? ? foreach A ? Q(B) \ D do disting ? true foreach A2 ? Q(B) \ {A} do if N k (A) ? N k (A2) and N k (A2) N k (A) then disting ? false foreach A3 ? D ? do if N k (A) ? N k (A3), p.3, 2008. ,
Query-answering cg knowledge bases, ICCS '08: Proceedings of the 16th international conference on Conceptual Structures, pp.147-160, 2008. ,
What makes a good answer? the role of context in question answering, In: INTERACT, 2003. ,
A Conceptual Graph approach to the Generation of Referring Expressions, Proceedings of the 20 th International Joint Conference on Artificial Intelligenc (IJCAI-2007, 2007. ,
Foundations of semantic web databases, PODS '04: Proceedings of the twenty-third ACM SIGMOD- SIGACT-SIGART symposium on Principles of database systems, pp.95-106, 2004. ,
OWL-QL???a language for deductive query answering on the Semantic Web, Web Semantics: Science, Services and Agents on the World Wide Web, vol.2, issue.1, pp.19-29, 2004. ,
DOI : 10.1016/j.websem.2004.07.002
Conceptual Graphs: Fundamental Notions. Revue d, Intelligence Artificielle, vol.6, issue.4, pp.365-406, 1992. ,
On conceptual structures, Artificial Intelligence, vol.34, issue.3, 1984. ,
DOI : 10.1016/0004-3702(88)90069-0
The SG family: Extensions of simple conceptual graphs, In: IJCAI, pp.205-212, 2001. ,
On generalization/specialization for conceptual graphs, Journal of Experimental & Theoretical Artificial Intelligence, vol.6, issue.3, pp.325-344, 1995. ,
DOI : 10.1137/0206053