Transputer network implementation of a parallel projection algorithm for conceptual graphs
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.
KeywordsParallelism Transputer Subgraph Isomorphism Conceptual Graph Processing Projection
Unable to display preview. Download preview PDF.
- 1.A. Celentano, Compiler testing using a sentence generator, Software-Practice and Experience, Vol., 10, 897–918(1980).Google Scholar
- 2.K. V. Hanford, Automatic generation of test cases, IBM system Journal, No. 4, 1970.Google Scholar
- 3.J. D. Roberts, R. Levinson and R. Hughey. Issues in Parallel Hardware for Conceptual Graph Retrieval, ICCS' 93.Google Scholar
- 4.J. F. Sowa, Conceptual Structures — Information Processing in Mind and Machine, Addison-Wesley Publishing Company, Inc. 1984.Google Scholar
- 5.J. R. Ullmann. An algorithm for subgraph isomorphism. Journal of the ACM, 16:31–42, 1976.Google Scholar
- 6.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.Google Scholar
- 7.W. T. Wipke and D. Rogers. Rapid Subgraph Search Using Parallelism, J. Chem. Inf. Comput. Sci. 1984, 24, 255–262.Google Scholar