Abstract.
Simple Conceptual Graphs (SGs) form the cornerstone for the "Conceptual Graphs" family of languages. In this model, the subsumption operation is called projection; it is a labelled graphs homomorphism (a NP-hard problem). Designing efficient algorithms to compute projections between two SGs is thus of uttermost importance for the community building languages on top of this basic model.
This paper presents some such algorithms, inspired by those developped for Constraint Satisfaction Problems. In order to benefit from the optimization work done in this community, we have chosen to present an alternate version of SGs, differences being the definition of these graphs as hypergraphs and the use of conjunctive types.
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
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
Baader, F., Molitor, R., Tobies, S.: Tractable and Decidable Fragments of Conceptual Graphs. In: Proc. of ICCS 1999, pp. 480–493. Springer, Heidelberg (1999)
Baget, J.-F.: A Simulation of Co-Identity with Rules in Simple and Nested Graphs. In: Proc. of ICCS 1999, pp. 442–455. Springer, Heidelberg (1999)
Baget, J.-F.: Extending the CG Model by Simulations. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS (LNAI), vol. 1867, pp. 277–291. Springer, Heidelberg (2000)
Baget, J.-F.: Re prsenter des connaissances et raisonner avec des hypergraphes: de la projection la drivation sous contraintes. PhD thesis, Un. Montpellier II (2001)
Baget, J.-F., Tognetti, Y.: Backtracking through Biconnected Components of a Constraint Graph. In: Proceedings of IJCAI 2001, vol. 1, pp. 291–296 (2001)
Becker, P., Hereth, J.: A Simplified Data Model for CGs (2001), http://tockit.sourceforge.net/papers/cgDataModel.pdf
Bessière, C., Meseguer, P., Freuder, E.C., Larrosa, X.: On Forward Checking for Non-Binary Constraint Satisfaction. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 88–102. Springer, Heidelberg (1999)
Cao, T.H.: Foundations of Order-Sorted Fuzzy Set Logic Programming in Predicate Logic and Conceptual Graphs. PhD thesis, Un. of Queensland (1999)
Chein, M., Mugnier, M.-L.: Conceptual Graphs: fundamental notions. Revue d’Intelligence Artificielle 6(4), 365–406 (1992)
Gaschnig, J.: Performance measurement and analysis of certain search algorithms. Research report CMU–CS–79–124, Carnegie-Mellon University (1979)
Genest, D., Salvat, E.: A Platform Allowing Typed Nested Graphs: How CoGITo Became CoGITaNT. In: Proc. of ICCS 1998, pp. 154–161. Springer, Heidelberg (1998)
Golomb, S.W., Baumert, L.D.: Backtrack Programming. Journal of the ACM 12, 516–524 (1965)
Haralick, R.M., Elliott, G.L.: Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence 14, 263–314 (1980)
Hayes, P.: RDF Model Theory. W3c working draft (2001)
Kerdiles, G.: Projection: A Unification Procedure for Tableaux in Conceptual Graphs. In: Galmiche, D. (ed.) TABLEAUX 1997. LNCS, vol. 1227, pp. 138–152. Springer, Heidelberg (1997)
Mugnier, M.-L.: Knowledge Representation and Reasonings Based on Graph Homomorphism. In: Proc. of ICCS 2000, pp. 172–192. Springer, Heidelberg (2000)
Mugnier, M.-L., Chein, M.: Re prsenter des connaissances et raisonner avec des graphes. Revue d’Intelligence Artificielle 10(1), 7–56 (1996)
Prosser, P.: Hybrid Algorithms for the Constraint Satisfaction Problem. Computational Intelligence 9(3), 268–299 (1993)
Salvat, E., Mugnier, M.-L.: Sound and Complete Forward and Backward Chainings of Graphs Rules. In: Proc. of ICCS 1996. Springer, Heidelberg (1996)
Smith, B.: Locating the Phase Transition in Binary Constraint Satisfaction Problems. Artificial Intelligence 81, 155–181 (1996)
Sowa, J.F.: Conceptual Graphs for a Database Interface. IBM Journal of Research and Development 20(4), 6–57 (1976)
Sowa, J.F.: Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley, Reading (1984)
Wermelinger, M.: Conceptual Graphs anf First-Order Logic. In: Proc. of ICCS 1995. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baget, JF. (2003). Simple Conceptual Graphs Revisited: Hypergraphs and Conjunctive Types for Efficient Projection Algorithms. In: Ganter, B., de Moor, A., Lex, W. (eds) Conceptual Structures for Knowledge Creation and Communication. ICCS 2003. Lecture Notes in Computer Science(), vol 2746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45091-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-45091-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40576-4
Online ISBN: 978-3-540-45091-7
eBook Packages: Springer Book Archive