The SG Family: Extensions of Simple Conceptual Graphs
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 205-211.
Abstract
We introduce the family of graph-based knowledge representation and reasoning models, basically extensions of the simple conceptual graphs model. Objects of these models are colored simple graphs and are used to represent facts, rules and constraints. Reasonings are based on graphtheoretic mechanisms, mainly graph homomorphism. Models of this family are defined by the kind of objects composing a knowledge base. In this paper, we focus on the formal definitions of these models, including their operational semantics and relationships with FOL, and we study their decidability properties and computational complexity.
@inproceedings{ijcai2001p29,
title = {The SG Family: Extensions of Simple Conceptual Graphs},
author = {Baget, Jean-François and Mugnier, Marie-Laure},
booktitle = {Proceedings of the Seventeenth International Joint Conference on
Artificial Intelligence, {IJCAI-01}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {205--211},
year = {2001},
url = {https://ijcai.org/proceedings/2001/29},
}
TY - CPAPER TI - The SG Family: Extensions of Simple Conceptual Graphs AU - Baget, Jean-François AU - Mugnier, Marie-Laure T2 - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 PB - International Joint Conferences on Artificial Intelligence PY - 2001 SP - 205 EP - 211 UR - https://ijcai.org/proceedings/2001/29 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
