A Distributed Conncetionist Representation for Concept Structures

We describe a representation for frame-like concept structures ina neural network called DUCS. Slot names and slot fillers axe diffuse patternsof activation spread over a collection of units. Our choice of a distributedrepresentation gives rise to certain useful properties not shaied by conventionalframe systems. One of these is the ability to encode fine semantic distinctions assubtle vairiations on the canonical pattern for a slot. D U C S typically maintainsseveral concepts simultaneously in its concept memory; it can retrieve a conceptgiven one or more slots as cues. W e show how Hinton's notion of a "reduceddescription" cam be used to make one concept fill a slot in another

Accelerating K-12 computational thinking using scaffolding, staging, and abstraction

We describe a three-stage model of computing instruction beginning with a simple, highly scaffolded programming en-vironment (Kodu) and progressing to more challenging frame-works (Alice and Lego NXT-G). In moving between frame-works, students explore the similarities and differences in how concepts such as variables, conditionals, and looping are realized. This can potentially lead to a deeper under-standing of programming, bringing students closer to true computational thinking. Some novel strategies for teach-ing with Kodu are outlined. Finally, we briefly report on our methodology and select preliminary results from a pi-lot study using this curriculum with students ages 10–17, including several with disabilities

The Hearts of Symbols: Why Symbol Grounding is Irrelevant

Upon closer examination, and depending on who you read, "symbol grounding" turns out to be either the induction of trivial sensory predicates or the relabeling of a large portion of intelligent behavior as "transduction." Neither activity shows much promise for advancing our understanding of intelligence, although symbol grounding does have some utility in philosophical debates. The proper con- COTi for symbol processing researchers, both connectionist and classical, is to construct and manipulate symbols, not to ground them

A skeptic's menagerie: conflictors, preemptors, reinstaters, and zombies in nonmonotonic inheritance

Subtle differences in the method of constructing arguments in inheritance systems can result in profound differences in both the conclusions reached and the efficiency of inference. This paper focuses on issues surrounding the defeat of arguments in nonmonotonic inheritance. Looking primarily at skeptical reasoners, we analyze several types of defeat that may be encountered, especially the defeat of defeaters. Finally, we raise some questions specific to networks that mix strict and defeasible links.

Controlling search dynamics by manipulating energy landscapes

Abstract: "Touretzky and Hinton's DCPS (Distributed Connectionist Production System) is a neural network with complex dynamical properties. Visualization of the energy landscapes of some of its component modules leads to a better intuitive understanding of the model. Three visualization techniques are used in this paper. Analysis of the way energy landscapes change as modules interact during an annealing search suggests ways in which the search dynamics can be controlled, thereby improving the model's performance on difficult match cases.