Skip to main content
SpringerLink
Log in
Book cover

Conceptual Structures: Theory and Implementation pp 125–136Cite as

A reconstruction of conceptual graphs on top of a production system

  • Conference paper
  • First Online:

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

Abstract

In this paper, we study how several aspects of the Conceptual Graph theory can be implemented using the pattern-matching mechanisms of production systems. Usually, standard pattern matching applies to arbitrary data that, unlike CGs, do not rely on a particular theory. Reconstructions of Conceptual Graphs in terms of basic graphs have been proposed in the literature. We show that K, a graph representation language with “high-level” (rule-based) graph manipulation facilities, allows an elegant implementation of these proposals. We show how the CG projection is reconstructed from standard pattern matching. Such a mechanism provides the user with graph retrieval facilities. Moreover, K's inherent features, such as forward reasoning rules, are gracefully transferred to the resulting CG implementation with no further effort. The result is a production system that operates within the CG theory thus providing the basis for a flexible CG processor.

This work has been partly supported by program PRC-IA of the French Ministry of Research and by the European Community project MENELAS (AIM 2023).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. F. Sowa. Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley, London, 1984.

    Google Scholar 

  2. D. A. Waterman and F. Hayes-Roth, editors. Pattern-Directed Inference Systems. Academic Press, New York, 1978.

    Google Scholar 

  3. M. Willems. Generalization of conceptual graphs. In Proceedings of the 6 th Annual Workshop on Conceptual Graphs, pages 27–37, July 11–13, 1991.

    Google Scholar 

  4. G. Ellis and M. Willems. Analysis of semantic networks using graph grammars. In AAAI Spring Symposium on Propositional Knowledge Representation, 1992.

    Google Scholar 

  5. J. Bouaud. K, un langage pour l'implémentation d'outils de représentation des connaissances. PhD thesis, Université Paris 7, 22 juin 1989.

    Google Scholar 

  6. P. Kocura, K.K. Ho, D. Moorhouse, and G. Sharpe. Aspects of conceptual graphs processor design. In Proceedings of the 6 th Annual Workshop on Conceptual Graphs, pages 317–319, July 11–13, 1991.

    Google Scholar 

  7. R. Levinson and G. Ellis. Multi-level hierarchical retrieval. In Proceedings of the 6 th Annual Workshop on Conceptual Graphs, pages 67-81, July 11–13, 1991.

    Google Scholar 

  8. G. Ellis. Compiled hierarchical retrieval. In Proceedings of the 6 th Annual Workshop on Conceptual Graphs, pages 187–207, July 11–13, 1991.

    Google Scholar 

  9. M. Cavazza and P. Zweigenbaum. A semantic analyzer for natural language understanding in an expert domain. Applied Artificial Intelligence, 1992. (To appear).

    Google Scholar 

  10. C. L. Forgy. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19:17–37, 1982.

    Google Scholar 

  11. D. P. Miranker. TREAT — a better match algoritm for AI production systems. In Proceedings of the 6 th National Conference on Artificial Intelligence — AAAI-87, pages 42–47, Seattle, WA, July 13–17, 1987.

    Google Scholar 

  12. D. E. Smith and M. R. Genesereth. Ordering conjunctive queries. Artificial Intelligence, 26:171–215, 1985.

    Google Scholar 

  13. M. Tambe and P. S. Rosenbloom. A framework for investigating production system formulations with polynomially bounded match. In Proceedings of the 8 th National Conference on Artificial Intelligence — AAAI-90, pages 693–700, Boston, MA, July 29–August 3, 1990.

    Google Scholar 

  14. J. Bouaud. TREE: une stratégie de jointure pour système de production fondée sur la propagation de contraintes. In Proceedings of the 8 th Conference RFIA-AFCET, Lyon — Villeurbanne, France, November 27–29, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIAM, INSERM U194 & SIM AP-HP, 91, bd de l'Hpital, F-75634, Paris cedex 13, France

    Jacques Bouaud & Pierre Zweigenbaum

Authors
  1. Jacques Bouaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Zweigenbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Heather D. Pfeiffer Timothy E. Nagle

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag

About this paper

Cite this paper

Bouaud, J., Zweigenbaum, P. (1993). A reconstruction of conceptual graphs on top of a production system. In: Pfeiffer, H.D., Nagle, T.E. (eds) Conceptual Structures: Theory and Implementation. Lecture Notes in Computer Science, vol 754. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57454-9_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-57454-9_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57454-5

  • Online ISBN: 978-3-540-48189-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation