Conceptual Graphs and Datatypes - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Conceptual Graphs and Datatypes


Datatypes, like numbers or strings, are widely used in Knowledge Representation (e.g. in RDF(S)/OWL or UML languages). The usual model of simple conceptual graphs does not support datatypes. Some extensions of conceptual graphs have been proposed for using datatypes, however these extensions often wander from initial model of conceptual graphs by introducing for instance procedural relations between nodes. This paper proposes a datatype extension for the simple conceptual graph model. Our contribution is threefold. First, we allow the use of datatypes for typing concept nodes. Second, we define two families of conceptual graphs: factual graphs and query graphs, both close to initial model. Factual graph is used to represent factual knowledge, including values of datatypes. Query graph may contain concept nodes that represent conditional queries on values of datatypes; these conditions are expressed by regular operators on datatypes. Third, we adapt projection to operate from a query graph to a factual graph.

Dates et versions

hal-03255572 , version 1 (09-06-2021)



Thomas Raimbault, David Genest, Stéphane Loiseau. Conceptual Graphs and Datatypes. 17th International Conference on Conceptual Structures, ICCS 2009, 2009, Moscou, Russia. pp.270 - 283, ⟨10.1007/978-3-642-03079-6_21⟩. ⟨hal-03255572⟩
12 Consultations
0 Téléchargements



Gmail Facebook Twitter LinkedIn More