Implementation of SPARQL query language based on graph homomorphism

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4604 LNAI, Issue , 2007, Pages 472-475

  Corby, Olivier ^a   Faron Zucker, Catherine ^b  

^a INRIA   (France)

^b UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; INFORMATION RETRIEVAL; MODEL CHECKING; PATTERN MATCHING;

HOMOMORPHISM; W3C CANDIDATE;

QUERY LANGUAGES;

EID: 37249038214     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73681-3_37     Document Type: Conference Paper

References (4)

1. Baget, J.F.: Simple Conceptual Graphs Revisited: Hypergraphs and Conjunctive Types for Efficient Projection Algorithms. In: Ganter, B., de Moor, A., Lex, W. (eds.) ICCS 2003. LNCS, vol. 2746, pp. 229-242. Springer, Heidelberg (2003)
2. Corby, O., Dieng, R., Faron, C., Gandon, F.: Searching the Semantic Web: Approximate Query Processing based on Ontologies. IEEE Intelligent Systems 21(1) (2006)
3. Dieng-Kuntz, R., Corby, O.: Conceptual Graphs for Semantic Web Applications. In: Dau, F., Mugnier, M.-L., Stumme, G. (eds.) ICCS 2005. LNCS (LNAI), vol. 3596, Springer, Heidelberg (2005)
4. Croitoru, M., Compatangelo, E.: A combinatorial approach to conceptual graph projection checking. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol. 3339, pp. 130-143. Springer, Heidelberg (2004)