A Datatype Extension for Simple Conceptual Graphs and Conceptual Graphs Rules

Authors:
Jean-François Baget
Affiliations:
INRIA Rhône-Alpes & LIG / LIRMM,
Venue:
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
Year:
2007

Citing 7
Cited 2

Conceptual structures: information processing in mind and machine

Conceptual structures: information processing in mind and machine
Revised5 report on the algorithmic language scheme

ACM SIGPLAN Notices
From Actors to Processes: The Representation of Dynamic Knowledge Using Conceptual Graphs

ICCS '98 Proceedings of the 6th International Conference on Conceptual Structures: Theory, Tools and Applications
RDF entailment as a graph homomorphism

ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Some algorithmic improvements for the containment problem of conjunctive queries with negation

ICDT'07 Proceedings of the 11th international conference on Database Theory
Simple conceptual graphs and simple concept graphs

ICCS'06 Proceedings of the 14th international conference on Conceptual Structures: inspiration and Application
Rules dependencies in backward chaining of conceptual graphs rules

ICCS'06 Proceedings of the 14th international conference on Conceptual Structures: inspiration and Application

Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application

ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
Conceptual Graphs and Datatypes

ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies

Quantified Score

Hi-index	0.00

Visualization

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.