×

Pattern associativity and the retrieval of semantic networks. (English) Zbl 0800.68878


MSC:

68T30 Knowledge representation
68P20 Information storage and retrieval of data
68Q55 Semantics in the theory of computing
68P15 Database theory
Full Text: DOI

References:

[1] Poincare, H., Science and Hypothesis (1952), Dover: Dover New York · Zbl 0049.29106
[2] Klir, G. J., Architecture of Systems Problem-Solving (1985), Plenum Press: Plenum Press New York · Zbl 0648.68105
[3] Mansuripur, M., Introduction to Information Theory (1987), Prentice-Hall
[4] Reza, F., An Introduction to Information Theory (1961), McGraw-Hill · Zbl 0925.94068
[5] (Belkin, N. J.; van Rijsbergen, C. J., Proceedings of the Twelfth Annual International ACMSIGIR Conference on Research and Development in Information Retrieval (1989), ACM Press)
[6] Neal, J. G., A knowledge-based approach to natural language understanding, (Technical Report 85-06 (1985), Department of Computer Science, SUNY: Department of Computer Science, SUNY Buffalo)
[7] Shapiro, S. C., Generalized augmented transition network grammars for generation from semantic networks, American Journal of Computational Linguistics, 8, 1, 12-25 (1982)
[8] Sowa, J. F., Conceptual Structure: Information Processing in Mind and Machine (1984), Addison-Wesley: Addison-Wesley Reading, Mass · Zbl 0536.68077
[9] Levinson, R. A., Pattern associativity and the retrieval of semantic networks, (Technical Report 90-30 (1990), Baskin Center of Computer Science, Univ. of California: Baskin Center of Computer Science, Univ. of California Santa Cruz), available from the · Zbl 0800.68878
[10] Fillmore, C. J., The case for Case, (Bach, E.; Harris, R. T., Universals in Linguistic Theory (1968), Holt Rinehart and Winston: Holt Rinehart and Winston New York)
[11] Shapiro, S. C.; Rappaport, W. J., SNEPS Considered as a fully intensional propositional semantic network, (Cercone, Nick; McCalla, Gordon, Knowledge Frontier (1983), Springer-Verlag), 262-315
[12] Reghbati, H.; Cercone, N., On representational aspects of VLSI-CADT systems, (Cercone, N.; McCalla, G., Knowledge Frontier (1983), Springer-Verlag), 451-470
[13] Shaw, A. C., A formal picture description scheme as a basis for picture processing systems, Information and Control, 14, 9-51 (1969) · Zbl 0167.18203
[14] Shaw, A. C., Parsing of graph-representable pictures, Journal of ACM, 17, 3, 453-481 (1970) · Zbl 0215.56403
[15] Schalkoff, R. J., Digital Image Processing and Computer Vision, ((1989), Wiley), 286
[16] Allen, F. H.; Bellard, S., The Cambridge crystallographic data centre: Computer-based search, retrieval, analysis and display of information, Acta Crystallogr., B35, 2330-2331 (1979)
[17] Adamson, G. W.; Cowell, J.; Lynch, M. F.; McLure, H. W.; Town, W. G.; Yapp, M. A., Strategic considerations in the design of a screening system for substructure searches of chemical structure files, J. Chem. Doc., 13, 153-157 (1973)
[18] Bawden, D. J., Computerized chemical structure-handling techniques in structure-activity studies and molecular property prediction, Chem. Inf. Comp. Sci., 23, 14-22 (1983)
[19] Willett, P., The evaluation of an automatically indexed, machine readable chemical reactions file, Journal of Chemical Information and Computer Sciences, 20, 93-96 (1980)
[20] Rao, A. S.; Foo, N. Y., CONGRESS: Conceptual graph reasoning system, (Proc. of the 3rd IEEE Conference on Artificial Intelligence Applications. Proc. of the 3rd IEEE Conference on Artificial Intelligence Applications, Orlando, Florida (1987)), 87-92
[21] Rau, L. F., Exploiting the semantics of conceptual graphs for efficient graph matching, (Esch, John W., Proc. of the 3rd Annual Workshop on Conceptual Graphs (Aug. 1988)), 3.2.4-1-3.2.4-10
[22] Aho, A.; Hopcroft, A.; Ullman, J., Data Structures and Algorithms (1983), Addison-Wesley · Zbl 0487.68005
[23] Horowitz, E.; Sahni, S., Fundamentals of Data Structures (1976), Computer Science Press · Zbl 0408.68003
[24] Levinson, R. A., A self-organizing pattern retrieval system for graphs, (Proc. AAAI-84 (1984))
[25] Levinson, R. A., A self-organizing retrieval system for graphs, (Ph.D. Dissertation (1985), Univ. of Texas at Austin)
[26] Levinson, R. A., A self-organizing pattern retrieval system and its applications, (Technical Report UCSC-CRL-89-21. Technical Report UCSC-CRL-89-21, International Journal of Intelligent Systems (1989), University of California at Santa Cruz), (To be published in
[27] Brachman, R.; Schmolze, J., An overview of the KL-ONE knowledge representation system, Cognitive Science, 9, 2, 171-216 (1985)
[28] Ellis, G., Efficient retrieval from the generalization hierarchy, (Proceedings of the 1st Australian Knowledge Engineering Program, presented at the AI and Creativity Workshop ’89. Proceedings of the 1st Australian Knowledge Engineering Program, presented at the AI and Creativity Workshop ’89, Melbourne, March 14-15th, (1989). Proceedings of the 1st Australian Knowledge Engineering Program, presented at the AI and Creativity Workshop ’89. Proceedings of the 1st Australian Knowledge Engineering Program, presented at the AI and Creativity Workshop ’89, Melbourne, March 14-15th, (1989), Technical Report No. 114 (May 1989), Dept. of Computer Science, University of Queensland: Dept. of Computer Science, University of Queensland Australia), Also available as
[29] Garner, B. J.; Tsui, E., A self-organizing dictionary for conceptual structures, (Gilmore, John F., Proceedings of Applications of Artificial Intelligence V. Proceedings of Applications of Artificial Intelligence V, May 18-20, 1987. Proceedings of Applications of Artificial Intelligence V. Proceedings of Applications of Artificial Intelligence V, May 18-20, 1987, SPIE Proc., 784 (1987)), 356-363
[30] Lipkis, T., A KL-ONE classifier, (Schmolze, J. G.; Brachman, R. J., BBN Report No. 4842 and Fairchild Technical Report No. 618. BBN Report No. 4842 and Fairchild Technical Report No. 618, Cambridge, Mass.. BBN Report No. 4842 and Fairchild Technical Report No. 618. BBN Report No. 4842 and Fairchild Technical Report No. 618, Cambridge, Mass., Proceedings of the 1981 KL-ONE Workshop (1982)), 128-145, (Published as
[31] Levinson, R. A., Pattern formation, associative recall and search: A proposal, (Technical Report UCSC-CRL-89-22 (1989), University of California: University of California Santa Cruz)
[32] Levinson, R. A., A self-learning, pattern-oriented, chess program, (Marsland, T. A., Proceedings of Workshop on New Directions in Game-Tree Search. Proceedings of Workshop on New Directions in Game-Tree Search, International Computer Chess Association Journal (January 1990), International Computer Chess Association), Edmonton
[33] Wilcox, C. S.; Levinson, R. A., A self-organized knowledge base for recall, design, and discovery in organic chemistry, (ACS Symposium Series. ACS Symposium Series, Artificial Intelligence Applications in Chemistry (1986)), 306
[34] Levinson, R. A.; Helman, D.; Oswalt, E., Intelligent signal analysis and recognition, (Proc. 1st Int’l Conference on Industrial and Engineering Applications of Artificial Intelligence (1988), ACM)
[35] Nagy, M. Z.; Kozics, S.; Veszpremi, T.; Bruck, P., Substructure search on very large files using tree structured data bases, (Warr, Wendy, Chemical Structure: The International Language of Chemistry (1988), Springer-Verlag)
[36] Barnard, J. M., Problems of substructure search and their solution, (Warr, Wendy, Chemical Structures: The International Language of Chemistry (1988), Springer-Verlag)
[37] Bhat, K. V.S., Refined vertex codes and vertex partitioning methodology for graph isomorphism testing, IEEE Trans. on Systems, Man, and Cybernetics, 10, 10, 610-615 (Oct 1980) · Zbl 0452.68069
[38] Corneil, D. G.; Kirkpatrick, D. G., A theoretical analysis of various heuristics for the graph isomorphism problem, Siam J. Computing, 9, 2 (May 1980) · Zbl 0451.05043
[39] Sussenguth, E. H., A graph-theoretic algorithm for matching chemical structures, J. Chem. Doc., 5, 36-43 (1965)
[40] Garey, M. R.; Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman · Zbl 0411.68039
[41] Schmidt, D. C.; Druffel, L. E., A fast backtracking algorithm to test directed graphs for isomorphism using distance matrices, J. Assoc. Comput. Mach., 23, 433-445 (1976) · Zbl 0357.05049
[42] Dittmar, P. G.; Farmer, N. A.; Fisanick, W.; Haines, R. C.; Mockus, J., The CAS online search system—General system design and selection, generation of search screens, Journal of Chemical Information and Computer Sciences, 23, 93-102 (1983)
[43] Riff, B., Searching a partially-ordered knowledge base of complex objects, (Master’s Thesis (1988), University of California: University of California Santa Cruz)
[44] Ellis, G., Deterministic all-solutions retrieval from the generalization hierarchy (August 1989), Dept. of Computer Science, University of Queensland: Dept. of Computer Science, University of Queensland Australia, Technical Report
[45] Nebel, B., Terminological reasoning is inherently intractable, Artificial Intelligence, 43, 235-249 (1990) · Zbl 0717.68089
[46] Hendrix, G., Encoding knowledge in partitioned networks, (Associative Networks: The Representation and Use of Knowledge by Machine (1979), Academic Press: Academic Press New York)
[47] (The MIND system: A data structure for semantic information processing. The MIND system: A data structure for semantic information processing, Tech Report No. R-837-PR (1971), The Rand Corporation)
[48] Schubert, L.; Goebel, R.; Cercone, N., The structure and organization of a semantic network for comprehension and inference, (Findler, N., Associative Networks: The Representation and Use of Knowledge by Machine (1979), Academic Press: Academic Press New York)
[49] Sowa, J. F., Semantic networks, (Shapiro, S. C., Encyclopedia of Artificial Intelligence (1987), Wiley: Wiley New York), 1011-1024 · Zbl 0664.68085
[50] Berge, C., Graphs and Hypergraphs (1976), North-Holland · Zbl 0483.05029
[51] Lum, E. H., An implementation of the key reaction approach in computer chemical synthesis, (M.S. Thesis (1990), University of California: University of California Santa Cruz)
[52] Graham Solomons, T. W., Organic Chemistry (1980), Wiley & Sons
[53] Langley, P.; Wogulis, J., Improving efficiency by learning intermediate concepts, (Proc. IJCAI-89 (1989), Morgan Kaufmann: Morgan Kaufmann San Mateo, CA), 657-662 · Zbl 0708.68054
[54] (Brachman, R.; Levesque, H. J., Readings in Knowledge Representation (1985), Morgan Kaufmann: Morgan Kaufmann Los Altos, California) · Zbl 0609.68007
[55] (Findler, N. V., Associative Networks: Representation and Use of Knowledge by Computers (1979), Academic Press: Academic Press New York, N.Y) · Zbl 0473.68088
[56] Hayes-Roth, F.; Mostow, D. J., An automatically compilable network recognition network for structured patterns, (Proc. IJCAI-75 (1975)), 246-251
[57] (Hinton, G. E.; Anderson, J. A., Parallel Models of Associative Memory (1989), L. Erlbaum) · Zbl 0685.68013
[58] Kolodner, J. L., Retrieval and Organizational Strategies in Conceptual Memory: A Computer Model (1984), L. Erlbaum and Associates
[59] Schmolze, J. G.; Lipkis, T. A., Classification in the KL-ONE knowledge representation system, (Proc. IJCAI-83 (1983)), 330-332
[60] Shannon, C. E., A mathematical theory of information, Bell Systems Technical Journal, 27, 623-656 (July and October, 1948) · Zbl 1154.94303
[61] Stanfill, C.; Waltz, D., Toward memory-based reasoning, Comm. of the ACM, 29, 12, 1213-1228 (December 1986)
[62] Turing, A., Computing machinery and intelligence, (Feigenbaum, E. A.; Feldman, J., Computers and Thought (1963), McGraw-Hill: McGraw-Hill New York) · Zbl 0219.68052
[63] Wipke, W. T.; Braun, H.; Smith, G.; Choplin, F.; Sieber, W., Computer assisted organic synthesis, (Wipke, W. T.; Howe, W. J., ACS Symposium Series, 61 (1977)), 97-125
[64] Woods, W. A., What’s in a link: Foundations for semantic networks, (Bobrow, D. G.; Collins, A. M., Representation and Understanding: Studies in Cognitive Science (1975), Academic Press: Academic Press New York, N.Y), 35-82
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.