Skip to Main content Skip to Navigation
Conference papers

A Datatype Extension for Simple Conceptual Graphs and Conceptual Graphs Rules

Jean-François Baget 1, 2 
1 ACACIA - Knowledge acquisition for aided design through agent interaction
CRISAM - Inria Sophia Antipolis - Méditerranée
2 GRAPHIK - Graphs for Inferences on Knowledge
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : We propose in this paper an extension of Conceptual Graphs that allows to use datatypes (strings, numbers, ...) for typing concept nodes. Though the model-theoretic semantics of these datatypes is inspired by the work done for RDF/RDFS, keeping sound and complete projection-based algorithms for deduction has led to strong syntactic restrictions (datatyped concept nodes of a target graph cannot be generic). This restriction, however, allows us to smoothly upgrade our extension to rules, and to introduce functional relations (that compute the value of datatyped concept nodes) while keeping sound and complete reasonings.
Document type :
Conference papers
Complete list of metadata
Contributor : Jean-François Baget Connect in order to contact the contributor
Submitted on : Tuesday, December 11, 2007 - 9:29:34 AM
Last modification on : Friday, August 5, 2022 - 3:03:00 PM

Links full text



Jean-François Baget. A Datatype Extension for Simple Conceptual Graphs and Conceptual Graphs Rules. ICCS: International Conference on Conceptual Structures, Jul 2007, Sheffield, United Kingdom. pp.83-96, ⟨10.1007/978-3-540-73681-3_7⟩. ⟨lirmm-00195482⟩



Record views