RDF entailment as a graph homomorphism

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

Volumn 3729 LNCS, Issue , 2005, Pages 82-96

  Baget, Jean François ^a  

^a INRIA RHÔNE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS;

GRAPH HOMOMORPHISM; NP-COMPLETE RDF ENTAILMENT PROBLEM; PAT HAYES INTERPOLATION LEMMA;

SEMANTICS;

EID: 33646426372     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11574620_9     Document Type: Conference Paper

References (15)

1. Hayes, P.: RDF Semantics. W3C Recommendation (2004) http://www.w3.org/TR/ 2004/REC-rdf-mt-20040210/.
2. ter Horst, H.J.: Extending the RDFS Entailment Lemma. In: Proceedings of the Third International Semantic Web Conference, ISWC'04. Volume 3298 of LNCS., Springer (2004) 77-91
3. Hahn, G., Tardif, C.: Graph homomorphisms: structure and symmetry. In: Graph Symmetry. Number 497 in NATO Adv. Sci. Inst. Ser. C. Math. Phys. Sci. (1997) 107-166
4. Chein, M., Mugnier, M.L.: Conceptual Graphs: fundamental notions. Revue d'Intelligence Artificielle 6 (1992) 365-406
5. Montanari, U.: Networks of Constraints: Fundamental Notions and Application to Picture Processing. Information Sciences 7 (1974) 95-132
6. Corby, O., Dieng, R., Hebert, C.: A Conceptual Graph Model for W3C Resource Description Framework. In: International Conference on Conceptual Structures. (2000) 468-482
7. Baget, J.F.: Homomorphismes d'hypergraphes pour la subsomption en RDF/RDFS. In: 10e conference sur langages et modèles à objets (LMO). Volume 10. (2004) 203-216
8. Genest, D.: Extensions du modèle des graphes conceptuels pour la recherche d'informations. PhD thesis, Université de Montpellier II (2000)
9. Hayes, J., Guttiérrez, C.: Bipartite Graphs as Intermediate Model for RDF. In: Proceedings of the Third International Semantic Web Conference, ISWC'04. Volume 3298 of LNCS., Springer (2004) 47-61
10. Baget, J.F.: Simple conceptual graphs revisited: hypergraphs and conjunctive types for efficient projection algorithms. In: 11th international conference on conceptual sructures (ICCS). Number 2870 in LNCS, Springer (2003) 195-208
11. Mugnier, M.L.: Knowledge Representation and Reasonings Based on Graph Homomorphism. In: 8th International Conference on Conceptual Structures (ICCS'00). Volume 1867 of LNCS., Springer (2000) 172-192
12. Mugnier, M.L., Chein, M.: Polynomial algorithms for projection and matching. In: Selected Papers from AWCG'92. Volume 754 of LNAI., Springer (1993)
13. Freuder, E.: A sufficient condition for backtrack-free search. Journal of the ACM 29 (1982) 24-32
14. Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural decomposition methods. (1999)
15. Guinaldo, O., Haemmerlé, O.: Knowledge querying in the conceptual graphs model: the RAP module. In: Proc. of ICCS. 98. LNCS, (Springer) 287-294