Abstract
The design, implementation on a network of transputers, and testing of a parallel projection algorithm which differs from traditional methods is described. A new automated testbed generator which produces large, complex CGs knowledge bases for testing CGs systems, is introduced and discussed. Extensive tests, using automatically generated data, show that the algorithm is scalable and free from excessive communication overhead. A parallel version of the Peirce-logic-based theorem prover is suggested.
Keywords
Preview
Unable to display preview. Download preview PDF.
References
A. Celentano, Compiler testing using a sentence generator, Software-Practice and Experience, Vol., 10, 897–918(1980).
K. V. Hanford, Automatic generation of test cases, IBM system Journal, No. 4, 1970.
J. D. Roberts, R. Levinson and R. Hughey. Issues in Parallel Hardware for Conceptual Graph Retrieval, ICCS' 93.
J. F. Sowa, Conceptual Structures — Information Processing in Mind and Machine, Addison-Wesley Publishing Company, Inc. 1984.
J. R. Ullmann. An algorithm for subgraph isomorphism. Journal of the ACM, 16:31–42, 1976.
P. Willett and T. Wilson. Atom-by-Atom Searching Using Massive Parallelism. Implementation of the Ullman Subgraph Isomorphism Algorithm on the Distributed Array Processor, J. Inf. Comput. Sci. 1991, 31, 225–233.
W. T. Wipke and D. Rogers. Rapid Subgraph Search Using Parallelism, J. Chem. Inf. Comput. Sci. 1984, 24, 255–262.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, A., Kocura, P. (1995). Transputer network implementation of a parallel projection algorithm for conceptual graphs. In: Ellis, G., Levinson, R., Rich, W., Sowa, J.F. (eds) Conceptual Structures: Applications, Implementation and Theory. ICCS 1995. Lecture Notes in Computer Science, vol 954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60161-9_40
Download citation
DOI: https://doi.org/10.1007/3-540-60161-9_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60161-6
Online ISBN: 978-3-540-49539-0
eBook Packages: Springer Book Archive