Abstract
This paper answers the SCG-1 initiative. The room allocation problem provided has been solved in a generic and automatic way. The solution is based on a totally declarative formal model. Basic constructs are simple graphs and the fundamental operation for doing reasonings is the graph morphism known as projection. The other formal constructs are rules and constraints defined in terms of simple graphs. The modeling framework built upon the formal model allows one to describe a problem with asserted facts, rules representing implicit knowledge about the domain, validity constraints and rules transforming the world. A prototype implementing this framework has been built upon the tool CoGITaNT. It has been used to test our modelization of the room allocation problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J.-F. Baget. A simulation of co-identity with rules in simple and nested graphs. In Proceedings of the 7th ICGS, 1999.
C. Bos, B. Botella, and P. Vanheeghe. Modeling and simulating human behaviors with conceptual graphs. In Conceptual Structures: Fulfilling Peirce’s Dream, ICCS’97 Proc, LNAI 1257, pages 275–289. Springer Verlag, 1997.
B. Carbonneill, M. Chein, O. Cogis, O. Guinaldo, O. Haemmerlé, M.L. Mugnier, and E. Salvat. The Conceptual gRAphs at LIrmm Project. In Proc. of the first CGTOOLS workshop, pages 5–8, 1996.
M. Chein. The CORALI project: Prom conceptual graphs to conceptual graphs via labelled graphs. In Conceptual Structures: Fulfilling Peirce’s Dream, ICCS’97 Proc, LNAI 1257, pages 65–79. Springer Verlag, 1997.
M. Chein, M.-L. Mugnier, and G. Simonet. Nested Graphs: a Graph-based Knowledge Representation Model with FOL semantics. In Proc. KR’98, pages 524–534. Morgan Kaufmann, 1998.
M. Chein and M.L. Mugnier. Conceptual Graphs: Fundamental Notions. Revue d’Intelligence Artificielle, 6(4):365–406, 1992.
S. Coulondre and E. Salvat. Piece Resolution: Towards Larger Perspectives. In Conceptual Structures: Theory, Tools and Applications, IGCS’98 Proc, LNAI 1453, pages 179–193. Springer Verlag, 1998.
J. Dibie, O. Haemmerlé, and S. Loiseau. A Semantic Validation of Conceptual Graphs. In Conceptual Structures: Theory, Tools and Applications, ICCS’98 Proc, LNAI 1453, pages 80–93. Springer Verlag, 1998.
D. Genest and M. Chein. An experiment in Document Retrieval Using Conceptual Graphs. In Conceptual Structures: Fulfilling Peirce’s Dream, ICCS’97 Proc, LNAI 1257, pages 489–504. Springer Verlag, 1997.
D. Genest and E. Salvat. A Platform Allowing Typed Nested Graphs: How CoGITo Became CoGITaNT. In Conceptual Structures: Theory, Tools and Applications, ICCS’98 Proc, LNAI 1453, pages 154–161. Springer Verlag, 1998.
O. Haemmerlé. CoGITo: une plate-forme de développement de logiciels sur les graphes conceptuels. PhD thesis, Université Montpellier II, 1995.
E. Salvat. Theorem proving using graph operations in the conceptual graph for malism. In Proceedings of the 13th European Conference on Artificial Intelligence (ECAF98), Brighton, UK, 1998.
E. Salvat and M.L. Mugnier. Sound and complete forward and backward chainings of graph rules. In Conceptual Structures: Knowledge Representation as Interlingua, ICCS’96 Proc, LNAI 1115, pages 248–262. Springer, 1996.
L.K. Schubert. Semantic Networks are in the Eye of the Beholder. In J. F. Sowa, editor, Principles of Semantic Networks, pages 95–108. Morgan Kaufmann, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baget, J.F., Genest, D., Mugnier, M.L. (1999). A Pure Graph-Based Solution to the SCG-1 Initiative. In: Tepfenhart, W.M., Cyre, W. (eds) Conceptual Structures: Standards and Practices. ICCS 1999. Lecture Notes in Computer Science(), vol 1640. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48659-3_22
Download citation
DOI: https://doi.org/10.1007/3-540-48659-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66223-5
Online ISBN: 978-3-540-48659-6
eBook Packages: Springer Book Archive