This paper investigates connectionism's potential to solve the frame problem. The frame problem arises in the context of modelling the human ability to see the relevant consequences of events in a situation. It has been claimed to be unsolvable for classical cognitive science, but easily manageable for connectionism. We will focus on a representational approach to the frame problem which advocates the use of intrinsic representations. We argue that although connectionism's distributed representations may look promising from this perspective, doubts can (...) be raised about the potential of distributed representations to allow large amounts of complexly structured information to be adequately encoded and processed. It is questionable whether connectionist models that are claimed to effectively represent structured information can be scaled up to a realistic extent. We conclude that the frame problem provides a difficulty to connectionism that is no less serious than the obstacle it constitutes for classical cognitive science. (shrink)

Performance on the Wason selection task varies with content. This has been taken to demonstrate that there are different cognitive modules for dealing with different conceptual domains. This implication is only legitimate if our underlying cognitive architecture is formal. A non-formal system can explain content-sensitive inference without appeal to independent inferential modules.

Lange & Dyer misunderstand what is meant by an “entity” and confuse a medium of representation with the content being represented. This leads them to the erroneous conclusion that SHRUTI will run out of phases and that its representation of bindings lacks semantic content. It is argued that the limit on the number of phases suffices, and SHRUTI can be interpreted as using “dynamic signatures” that offer significant advantages over fixed preexisting signatures. Bonatti refers to three levels of commitment to (...) a representational theory of the mind and states that SHRUTI is committed to RTM at levels 1 and 2. He acknowledges that SHRUTI is not committed at level 3, but argues that an extended SHRUTI would have to make such a commitment. We agree that SHRUTI is committed to RTM at level 1 and, in a sense, also at level 2. SHRUTI, however, is not committed to RTM at level 3 and, even though it has been extended in several ways, it has retained its original representational character. (shrink)

This paper reviews four significant advances on the feedforward architecture that has dominated discussions of connectionism. The first involves introducing modularity into networks by employing procedures whereby different networks learn to perform different components of a task, and a Gating Network determines which network is best equiped to respond to a given input. The second consists in the use of recurrent inputs whereby information from a previous cycle of processing is made available on later cycles. The third development involves developing (...) compressed representations of strings in which there is no longer an explicit encoding of the components but where information about the structure of the original string can be recovered and so is present functionally. The final advance entails using connectionist learning procedures not just to change weights in networks but to change the patterns used as inputs to the network. These advances significantly increase the usefulness of connectionist networks for modeling human cognitive performance by, among other things, providing tools for explaining the productivity and systematicity of some mental activities, and developing representations that are sensitive to the content they are to represent. (shrink)

A distributed neural network model called SPEC for processing sentences with recursive relative clauses is described. The model is based on separating the tasks of segmenting the input word sequence into clauses, forming the case‐role representations, and keeping track of the recursive embeddings into different modules. The system needs to be trained only with the basic sentence constructs, and it generalizes not only to new instances of familiar relative clause structures but to novel structures as well. SPEC exhibits plausible memory (...) degradation as the depth of the center embeddings increases, its memory is primed by earlier constituents, and its performance is aided by semantic constraints between the constituents. The ability to process structure is largely due to a central executive network that monitors and controls the execution of the entire system. This way, in contrast to earlier subsymbolic systems, parsing is modeled as a controlled high‐level process rather than one based on automatic reflex responses. (shrink)

Question processing involves parsing, memory retrieval, question categorization, initiation of appropriate answer‐retrieval heuristics, answer formulation, and output. Computational and psychological models have traditionally treated these processes as separate, sequential, independent, and in pursuit of a single answer type at a time. Here this view is challenged and the implications of a theory in which question processes operate simultaneously on multiple question interpretations are explored. A highly interactive model is described in which an expectation‐driven parser generates multiple question candidates, including partially‐specified (...) candidates. Question candidates act as constraints for a matcher which activates memory items. An answer retrieval process examines question candidates and the active portions of memory in an attempt to generate answer candidates. Answer candidates are examined by an output process that derives the final answer. These processes run simultaneously and interact. Three experiments on human question answering are also described which provide evidence that working memory load during question reading is affected by processes related to answer retrieval. (shrink)

This paper deals with the problem of understanding semiosis and meaning in cognitive systems. To this aim we argue for a unified two-factor account according to which both external and internal information are non-independent aspects of meaning, thus contributing as a whole in determining its nature. To overcome the difficulties stemming from this approach we put forward a theoretical scheme based on the definition of a suitable representation space endowed with a set of transformations, and we show how it can (...) be implemented, in the case of a single agent, by a neural network architecture. Numerical experiments conducted on different instances of the latter show that similar representations are developed as a consequence of the fact that these instances are facing a similar semantic task. This allows to model social and environmental influences through a system of interacting agents, each described by a specific implementation of this model architecture. (shrink)

The target article demonstrates how neurocognitive modellers should not be intimidated by challenges such as Jackendoff's and should explore neurally plausible implementations of linguistic constructs. The next step is to take seriously insights offlered by neuroscience, including the robustness allowed by analogue computation with distributed representations and the power of attractor dynamics in turning analogue into nearly discrete operations.

I argue that SHRUTl's ontology is heavily committed to a representational view of mind. This is best seen when one thinks of how SHRUTI could be developed to account for psychological data on deductive reasoning.

Shastri & Ajjanagadde argue convincingly that both structured connectionist networks and parallel dynamic inferencing are necessary for reflexive reasoning - a kind of inferencing and reasoning that occurs rapidly, spontaneously, and without conscious effort, and which seems necessary for everyday tasks such as natural language understanding. As S&A describe, reflexive reasoning requires a solution to thedynamic binding problem, that is, how to encode systematic and abstract knowledge and instantiate it in specific situations to draw appropriate inferences. Although symbolic artificial intelligence (...) systems trivially solve the dynamic binding problem using computers' registers and pointers, it has remained a difficult problem for connectionist systems. S&A's temporal synchrony solution to the dynamic binding problem using synchronous firing of argument units and the entities that are bound to them illustrates one way in which connectionist networks can do thisusing a constrained but important class of long-term knowledge rules. Their structured connectionist solution allows dynamic inferencing to proceed in parallel and therefore has a number of advantages for reflexive reasoning over most other connectionist and symbolic systems. (shrink)