{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T02:52:24Z","timestamp":1692499944720},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[1995,4]]},"DOI":"10.1007\/bf00877228","type":"journal-article","created":{"date-parts":[[2004,12,27]],"date-time":"2004-12-27T15:38:06Z","timestamp":1104161886000},"page":"103-135","source":"Crossref","is-referenced-by-count":3,"title":["High-level reasoning, computational challenges for connectionism, and the Conposit solution"],"prefix":"10.1007","volume":"5","author":[{"given":"John A.","family":"Barnden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"CR1","first-page":"25","volume":"7","author":"J.A. Barnden","year":"1984","unstructured":"J.A. Barnden, ?On short-term information processing in connectionist theories,?Cognition and Brain Theory, 7(1), pp. 25?59, 1984.","journal-title":"Cognition and Brain Theory"},{"issue":"3","key":"CR2","first-page":"285","volume":"7","author":"J.A. Barnden","year":"1985","unstructured":"J.A. Barnden, ?Diagrammatic short-term information processing by neural mechanisms.?Cognition and Brain Theory, 7, (3 & 4), pp. 285?328, 1985.","journal-title":"Cognition and Brain Theory"},{"key":"CR3","first-page":"568","volume-title":"Procs. 11th Int. Joint Conf. on Artificial Intelligence","author":"J.A. Barnden","year":"1989","unstructured":"J.A. Barnden, ?Neural-net implementation of complex symbol-processing in a mental model approach to syllogistic reasoning,? inProcs. 11th Int. Joint Conf. on Artificial Intelligence, San Mateo, CA: Morgan Kaufmann, pp. 568?573, 1989."},{"key":"CR4","unstructured":"J.A. Barnden, ?Syllogistic mental models: exercising some connectionist representation and control methods,? Computing Research Laboratory, New Mexico State University, Las Cruces, NM 88003,Memoranda in Computer and Cognitive Science, No. MCCS-90-204, 1990."},{"key":"CR5","first-page":"180","volume-title":"Advances in Connectionist and Neural Computation Theory, Vol. 1","author":"J.A. Barnden","year":"1991","unstructured":"J.A. Barnden, ?Encoding complex symbolic data structures with some unusual connectionist techniques,? in J.A. Barnden and J.B. Pollack (Eds.),Advances in Connectionist and Neural Computation Theory, Vol. 1, Norwood, N.J.: Ablex Publishing Corp., pp. 180?240, 1991."},{"key":"CR6","first-page":"149","volume-title":"The Symbolic and Connectionist Paradigms: Closing the Gap","author":"J.A. Barnden","year":"1992","unstructured":"J.A. Barnden, ?Connectionism, generalization and propositional attitudes: a catalogue of challenging issues?, in J. Dinsmore (Ed.),The Symbolic and Connectionist Paradigms: Closing the Gap, Hillsdale, N.J.: Lawrence Erlbaum, pp. 149?178, 1992."},{"key":"CR7","unstructured":"J.A. Barnden, ?Connectionism, structure-sensitivity, and systematicity: refining the task requirements,? Computing Research Laboratory, New Mexico State University, Las Cruces, NM 88003,Memoranda in Computer and Cognitive Science, No. MCCS-92-227, 1992."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"J.A. Barnden, ?Time phases, pointers, rules and embedding,?Behavioral and Brain Sciences, 16(3), pp. 451?452.","DOI":"10.1017\/S0140525X00030922"},{"key":"CR9","first-page":"27","volume-title":"Neural Networks for Knowledge Representation and Inference","author":"J.A. Barnden","year":"1994","unstructured":"J.A. Barnden, ?On using analogy to reconcile connections and symbols,? in D.S. Levine and M. Aparicio (Eds.),Neural Networks for Knowledge Representation and Inference, Hillsdale, N.J.: Lawrence Erlbaum Associates, pp. 27?64, 1994."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"J.A. Barnden, ?Complex symbol-processing in Conposit, a transiently localist connectionist architecture,? in R. Sun and L. Bookman (Eds.),Computational Architectures for Integrating Neural and Symbolic Processes, Kluwer, pp. 21?68, 1994.","DOI":"10.1007\/978-0-585-29599-2_2"},{"key":"CR11","volume-title":"Advances in Connectionist and Neural Computation Theory, Vol. 1","year":"1991","unstructured":"J.A. Barnden and J.B. Pollack (Eds.),Advances in Connectionist and Neural Computation Theory, Vol. 1, Norwood, N.J.: Ablex Publishing Corp., 1991."},{"issue":"3","key":"CR12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1080\/09540099108946588","volume":"3","author":"J.A. Barnden","year":"1991","unstructured":"J.A. Barnden and K. Srinivas, ?Encoding techniques for complex information structures in connectionist systems,?Connection Science, 3(3), pp. 263?309, 1991.","journal-title":"Connection Science"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0020-7373(92)90015-D","volume":"36","author":"J.A. Barnden","year":"1992","unstructured":"J.A. Barnden and K. Srinivas, ?Overcoming rule-based rigidity and connectionist limitations through massively-parallel case-based reasoning,?Int. J. Man-Machine Studies, Vol. 36, pp. 221?246, 1992.","journal-title":"Int. J. Man-Machine Studies"},{"issue":"5","key":"CR14","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1109\/72.248461","volume":"4","author":"J.A. Barnden","year":"1993","unstructured":"J.A. Barnden and K. Srinivas, ?Temporal winner-talke-all networks: a time-based mechanism for fast selection in neural networks,?IEEE Trans. Neural Networks, 4(5), pp. 844?853, 1993.","journal-title":"IEEE Trans. Neural Networks"},{"key":"CR15","first-page":"113","volume-title":"The Symbolic and Connectionist Paradigms: Closing the Gap","author":"D.S. Blank","year":"1992","unstructured":"D.S. Blank, L.A. Meeden, and J.B. Marshall, ?Exploring the symbolic\/subsymbolic continuum: a case study of RAAM?, in J. Dinsmore (Ed.),The Symbolic and Connectionist Paradigms: Closing the Gap, Hillsdale, N.J.: Lawrence Erlbaum, pp. 113?148, 1992."},{"issue":"1","key":"CR16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1080\/09540099008915662","volume":"2","author":"D.J. Chalmers","year":"1990","unstructured":"D.J. Chalmers, ?Syntactic transformations on distributed representations,?Connection Science, 2(1 & 2), pp. 53?62, 1990.","journal-title":"Connection Science"},{"key":"CR17","volume-title":"Procs. 9th Annual Conference of the Cognitive Science Society","author":"E. Charniak","year":"1987","unstructured":"E. Charniak and E. Santos, ?A connectionist context-free parser which is not context-free, but then it is not really connectionist either?, inProcs. 9th Annual Conference of the Cognitive Science Society, Hillsdale, N.J.: Lawrence Erlbaum, 1987. A revised version appears in J.A. Barnden and J.B. Pollack (Eds.),Advances in Connectionist and Neural Computation Theory, Vol. 1, Norwood, N.J.: Ablex Publishing Corp., pp. 123?134, 1991."},{"issue":"4","key":"CR18","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1080\/09540099108946592","volume":"3","author":"L. Chrisman","year":"1991","unstructured":"L. Chrisman, ?Learning recursive distributed representations for holistic computation,?Connection Science, 3(4), pp. 354?366, 1991.","journal-title":"Connection Science"},{"key":"CR19","first-page":"380","volume-title":"Procs. Tenth Int. Joint Conf. On Artificial Intelligence","author":"H.W. Chun","year":"1987","unstructured":"H.W. Chun, L.A. Bookman, and N. Afshartous, ?Network Regions: alternatives to the winner-take-all structure,? inProcs. Tenth Int. Joint Conf. On Artificial Intelligence, Los Altos, CA: Morgan Kaufmann, pp. 380?387, 1987."},{"key":"CR20","first-page":"32","volume-title":"Advances in Connectionist and Neural Computation Theory, Vol. 1","author":"M.G. Dyer","year":"1991","unstructured":"M.G. Dyer, ?Symbolic Neuro Engineering and natural language processing: a multilevel research approach,? in J.A. Barnden and J.B. Pollack (Eds.),Advances in Connectionist and Neural Computation Theory, Vol. 1, Norwood, N.J.: Ablex Publishing Corp., pp. 32?86, 1991."},{"key":"CR21","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4917.001.0001","volume-title":"NETL: A system for representing real-wrpold knowledge","author":"S.E. Fahlman","year":"1979","unstructured":"S.E. Fahlman,NETL: A system for representing real-wrpold knowledge, Cambridge, MA: MIT Press, 1979."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1207\/s15516709cog0603_1","volume":"6","author":"J.A. Feldman","year":"1982","unstructured":"J.A. Feldman and D.H. Ballard, ?Connectionist models and their properties,?Cognitive Science, 6, pp. 205?254, 1982.","journal-title":"Cognitive Science"},{"key":"CR23","first-page":"3","volume-title":"Connections and symbols","author":"J.A. Fodor","year":"1988","unstructured":"J.A. Fodor and Z.W. Pylyshyn, ?Connectionism and cognitive architecture: a critical analysis,? in S. Pinker and J. Mehler (Eds.),Connections and symbols, Cambridge, Mass.: MIT Press, 1988, pp. 3?71. (Reprinted fromCognition, 28, 1988.)"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0893-6080(88)90021-4","volume":"1","author":"S. Grossberg","year":"1988","unstructured":"S. Grossberg, ?Nonlinear neural networks: principles, mechanisms, and architectures,?Neural Networks, 1, pp. 17?61, 1988.","journal-title":"Neural Networks"},{"issue":"1","key":"CR25","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0004-3702(90)90004-J","volume":"46","author":"G.E. Hinton","year":"1990","unstructured":"G.E. Hinton, ?Mapping part-whole hierarchies into connectionist networks,?Artificial Intelligence, 46(1 & 2), pp. 47?75, 1990.","journal-title":"Artificial Intelligence"},{"key":"CR26","volume-title":"Connectionist symbol processing","year":"1991","unstructured":"G.E. Hinton (Ed.),Connectionist symbol processing. Cambridge, MA: MIT Press, 1991."},{"key":"CR27","volume-title":"Mental Models: Towards a Cognitive Science of Language, Inference and Consciousness","author":"P.N. Johnson-Laird","year":"1983","unstructured":"P.N. Johnson-Laird,Mental Models: Towards a Cognitive Science of Language, Inference and Consciousness, Cambridge, Mass.: Harvard University Press, 1983."},{"issue":"1","key":"CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0010-0277(84)90035-0","volume":"16","author":"P.N. Johnson-Laird","year":"1984","unstructured":"P.N. Johnson-Laird and B.G. Bara, ?Syllogistic inference,?Cognition, 16(1), pp. 1?61, 1984.","journal-title":"Cognition"},{"key":"CR29","volume-title":"Deduction","author":"P.N. Johnson-Laird","year":"1991","unstructured":"P.N. Johnson-Laird and R.M.J. Byrne,Deduction. Hove, U.K.: Lawrence Erlbaum, 1991."},{"key":"CR30","unstructured":"T.E. Lange, ?Hybrid connectionist models: temporary bridges over the gap between the symbolic and subsymbolic,? in J. Dinsmore (Ed.),The Symbolic and Connectionist Hillsdale, N.J.: Paradigms; Closing the Gap, Lawrence Erlbaum, pp. 237?289, 1992."},{"key":"CR31","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/MASSP.1987.1165576","volume":"4","author":"R.R. Lippmann","year":"1987","unstructured":"R.R. Lippmann, ?An introduction to computing with neural nets,?IEEE ASSP Magazine, 4, pp. 4?22, 1987.","journal-title":"IEEE ASSP Magazine"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1080\/14640748508400919","volume":"37A","author":"J.V. Oakhill","year":"1985","unstructured":"J.V. Oakhill and P.N. Johnson-Laird, ?The effects of belief on the spontaneous production of syllogistic conclusions,?The Quarterly J. of Experimental Psych., 37A, pp. 553?569, 1985.","journal-title":"The Quarterly J. of Experimental Psych."},{"key":"CR33","unstructured":"T. Plate, ?Holographic reduced representations,? Dept. of Computer Science, University of Toronto, Canada M5S 1A4, Tech. Report CRG-TR-91-1, 1991."},{"issue":"1","key":"CR34","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0004-3702(90)90005-K","volume":"46","author":"J.B. Pollack","year":"1990","unstructured":"J.B. Pollack, ?Recursive distributed representations,?Artificial Intelligence, 46 (1 & 2), pp. 77?105, 1990.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"CR35","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1017\/S0140525X00030910","volume":"16","author":"L. Shastri","year":"1993","unstructured":"L. Shastri and V. Ajjanagadde, ?From simple associations to systematic reasoning: a connectionist representation of rules, variables, and dynamic bindings using temporal synchrony,?Behavioral and Brain Sciences, 16(3), pp. 417?494, 1993.","journal-title":"Behavioral and Brain Sciences"},{"issue":"1?2","key":"CR36","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0004-3702(90)90007-M","volume":"46","author":"P. Smolensky","year":"1990","unstructured":"P. Smolensky, ?Tensor product variable binding and the representation of symbolic structures in connectionist systems,?Artificial Intelligence, 46(1?2), pp. 159?216, 1990.","journal-title":"Artificial Intelligence"},{"key":"CR37","volume-title":"Tree matching with recursive distributed representations","author":"A. Stolcke","year":"1992","unstructured":"A. Stolcke and D. Wu, ?Tree matching with recursive distributed representations,? Computer Science Division, University of California, Berkeley, CA 94704, TR-92-025, 1992."},{"issue":"2","key":"CR38","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1080\/09540099208946607","volume":"4","author":"R. Sun","year":"1992","unstructured":"R. Sun, ?On variable binding in connectionist networks,?Connection Science, 4(2), pp. 93?124, 1992.","journal-title":"Connection Science"},{"issue":"1","key":"CR39","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0004-3702(90)90003-I","volume":"46","author":"D.S. Touretzky","year":"1990","unstructured":"D.S. Touretzky, ?BoltzCONS: dynamic symbol structures in a connectionist network,?Artificial Intelligence, 46(1 & 2), pp. 5?46, 1990.","journal-title":"Artificial Intelligence"},{"key":"CR40","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1162\/neco.1989.1.3.334","volume":"1","author":"A.L. Yuille","year":"1989","unstructured":"A.L. Yuille and Grzywacz, ?A winner-take-all mechanism based on presynaptic inhibition feedback,?Neural Computation, 1, pp. 334?347, 1989.","journal-title":"Neural Computation"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00877228.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00877228\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00877228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T00:05:26Z","timestamp":1586045126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00877228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["BF00877228"],"URL":"https:\/\/doi.org\/10.1007\/bf00877228","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}