Executing conceptual graphs

  • Walling R. Cyre
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1453)


This paper addresses the issue of directly executing conceptual graphs by developing an execution model that simulates interactions among behavioral concepts and with attributes related to object concepts. While several researchers have proposed various mechanisms for computing or simulating conceptual graphs, but these usually rely on extensions to conceptual graphs. The simulation algorithm described in this paper is inspired by digital logic simulators and reactive systems simulators. Behavior in conceptual graphs is described by action, event and state concept types along with all their subtypes. Activity in such concepts propagates over conceptual relations to invoke activity or changes in other behavioral concepts or to affect the attributes related to object type concepts. The challenging issues of orderly simulation of behavior recursively described by another graphs, and of combinational relations are also addressed.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    C. Bos, B. Botella and P. Vanheeghe, “Modelling and Simulating Human Behaviours with Conceptual Graphs,” Proc. 5th Int'l Conf. on Conceptual Structures, Seattle, WA, 275–289, August 3–8, 1997.Google Scholar
  2. 2.
    Walling Cyre “A Requirements Language for Automated Analysis,” International Journal of Intelligent Systems, 10(7), 665–689, July, 1995.Google Scholar
  3. 3.
    W. R. Cyre, S. Balachandar, and A. Thakar, “Knowledge Visualization from Conceptual Structures,” Proc. 2nd Int'l Conf. on Conceptual Structures, College Park, MD, 275–292, August 16–20, 1994.Google Scholar
  4. 4.
    W. R. Cyre, “Acquiring Temporal Knowledge from Schedules,” in G. Mineau, B. Moulin, J. Sowa, eds., Conceptual Graphs for Knowledge Representation, Springer-Verlag, NY, 328–344, 1993. (ICCS'93)Google Scholar
  5. 5.
    H. Delugach, “Dynamic Assertion and Retraction of Conceptual Graphs,” Proc. 7th Workshop on Conceptual Structures, Binghamton, NY, July 11–13, 1991.Google Scholar
  6. 6.
    H. Delugach, “Using Conceptual Graphs to Analyze Multiple Views of Software Requirements,” Proc. 6th Workshop on Conceptual Structures, Boston,MA, July 29, 1990.Google Scholar
  7. 7.
    J. Dennis, “First Version of a Data Flow Procedure Language,” Lecture Notes in Computer Science, Springer-Verlag, NY, 362–376, 1974.Google Scholar
  8. 8.
    D. Harel and A. Naamad, The STATEMATE Semantics of Statecharts, i-Logix, Inc. Andover, MA, June 1995.Google Scholar
  9. 9.
    R. Lipsett, C.F. Schaefer & C. Ussery, VHDL: Hardware Description and Design, Kluwer Academic, Boston, 1989.Google Scholar
  10. 10.
    D. Lukose, “Executable Conceptual Structures,” Proc. 1st Int'l Conf. on Conceptual Structures, Quebec City, Canada, 223–237, August 4–7, 1993.Google Scholar
  11. 11.
    G. Mann, “A Rational Goal-Seeking Agent using Conceptual Graphs,” Proc. 2nd Int'l Conf. on Conceptual Structures, College Park, MD, 113–126, August 16–20, 1994.Google Scholar
  12. 12.
    R. Raban and H. S. Delugach, “Animating Conceptual Graphs,” Proc. 5th Int'l Conf. on Conceptual Structures, Seattle, WA, 431–445, August 3–8, 1997.Google Scholar
  13. 13.
    J. Sowa, Conceptual Structures, Addison-Wesley, Reading, MA, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Walling R. Cyre
    • 1
  1. 1.The Bradley Department of Electrical and Computer EngineeringVirginia TechBlacksburg

Personalised recommendations