Skip to main content
SpringerLink
Log in

Simple Conceptual Graphs Revisited: Hypergraphs and Conjunctive Types for Efficient Projection Algorithms

  • Conference paper
Conceptual Structures for Knowledge Creation and Communication (ICCS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2746))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Baader, F., Molitor, R., Tobies, S.: Tractable and Decidable Fragments of Conceptual Graphs. In: Proc. of ICCS 1999, pp. 480–493. Springer, Heidelberg (1999)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. 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)

    Google Scholar 

  6. Baget, J.-F., Tognetti, Y.: Backtracking through Biconnected Components of a Constraint Graph. In: Proceedings of IJCAI 2001, vol. 1, pp. 291–296 (2001)

    Google Scholar 

  7. Becker, P., Hereth, J.: A Simplified Data Model for CGs (2001), http://tockit.sourceforge.net/papers/cgDataModel.pdf

  8. 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)

    Google Scholar 

  9. Cao, T.H.: Foundations of Order-Sorted Fuzzy Set Logic Programming in Predicate Logic and Conceptual Graphs. PhD thesis, Un. of Queensland (1999)

    Google Scholar 

  10. Chein, M., Mugnier, M.-L.: Conceptual Graphs: fundamental notions. Revue d’Intelligence Artificielle 6(4), 365–406 (1992)

    Google Scholar 

  11. Gaschnig, J.: Performance measurement and analysis of certain search algorithms. Research report CMU–CS–79–124, Carnegie-Mellon University (1979)

    Google Scholar 

  12. 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)

    Google Scholar 

  13. Golomb, S.W., Baumert, L.D.: Backtrack Programming. Journal of the ACM 12, 516–524 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  14. Haralick, R.M., Elliott, G.L.: Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence 14, 263–314 (1980)

    Article  Google Scholar 

  15. Hayes, P.: RDF Model Theory. W3c working draft (2001)

    Google Scholar 

  16. 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)

    Chapter  Google Scholar 

  17. Mugnier, M.-L.: Knowledge Representation and Reasonings Based on Graph Homomorphism. In: Proc. of ICCS 2000, pp. 172–192. Springer, Heidelberg (2000)

    Google Scholar 

  18. Mugnier, M.-L., Chein, M.: Re prsenter des connaissances et raisonner avec des graphes. Revue d’Intelligence Artificielle 10(1), 7–56 (1996)

    MATH  Google Scholar 

  19. Prosser, P.: Hybrid Algorithms for the Constraint Satisfaction Problem. Computational Intelligence 9(3), 268–299 (1993)

    Article  Google Scholar 

  20. Salvat, E., Mugnier, M.-L.: Sound and Complete Forward and Backward Chainings of Graphs Rules. In: Proc. of ICCS 1996. Springer, Heidelberg (1996)

    Google Scholar 

  21. Smith, B.: Locating the Phase Transition in Binary Constraint Satisfaction Problems. Artificial Intelligence 81, 155–181 (1996)

    Article  MathSciNet  Google Scholar 

  22. Sowa, J.F.: Conceptual Graphs for a Database Interface. IBM Journal of Research and Development 20(4), 6–57 (1976)

    Article  MathSciNet  Google Scholar 

  23. Sowa, J.F.: Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley, Reading (1984)

    MATH  Google Scholar 

  24. Wermelinger, M.: Conceptual Graphs anf First-Order Logic. In: Proc. of ICCS 1995. Springer, Heidelberg (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA, Rhône-Alpes, France

    Jean-François Baget

Authors
  1. Jean-François Baget
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Algebra, University of Technology, Dresden, Germany

    Bernhard Ganter

  2. Semantics Technology and Applications Research Laboratory (STARLab), Department of Computer Science, Vrije Universiteit Brussel, Pleinlaan 2, B-1050, Brussels 5, Belgium

    Aldo de Moor

  3. Institut für Algebra, Technische Universität Dresden, 01062, Dresden, Germany

    Wilfried Lex

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation