Abstract
This paper describes a conceptual graph tool called the Extendible Graph Processor (EGP). We will review its architecture, application, limitations, and future developments.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Garner, B.J., Tsui, E., Lui, D., Lukose, D., and Koh, J., Progress on an Extendible Graph Processor for Knowledge Acquisition, Planning and Reasoning, Current Directions in Conceptual Structure Research, Tim Nagle, Jan Nagle, Laurie Gerholz and Peter Eklund (Eds.). Ellis Horwood, 1992.
Kremer, R., A Graphical Meta-Language for Knowledge Representation, (In Progress) PhD Dissertation, University of Calgary, Canada, 1997.
Lukose, D., Conceptual Graph Tutorial, Technical Report, Department of Computing and Mathematics, Deakin University, Geelong, 3217, Victoria, Australia, 1991.
Nash, L., MUprolog 3.1b Reference Manual, Melbourne University, September 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsui, E., Garner, B., Lukose, D. (1997). EGP: Extendible graph processor. In: Lukose, D., Delugach, H., Keeler, M., Searle, L., Sowa, J. (eds) Conceptual Structures: Fulfilling Peirce's Dream. ICCS 1997. Lecture Notes in Computer Science, vol 1257. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027903
Download citation
DOI: https://doi.org/10.1007/BFb0027903
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63308-2
Online ISBN: 978-3-540-69424-3
eBook Packages: Springer Book Archive