A substantial body of experimental evidence has demonstrated that labels have an impact on infant categorization processes. Yet little is known regarding the nature of the mechanisms by which this effect is achieved. We distinguish between two competing accounts: supervised name‐based categorization and unsupervised feature‐based categorization. We describe a neurocomputational model of infant visual categorization, based on self‐organizing maps, that implements the unsupervised feature‐based approach. The model successfully reproduces experiments demonstrating the impact of labeling on infant visual categorization reported in (...) Plunkett, Hu, and Cohen (2008). It mimics infant behavior in both the familiarization and testing phases of the procedure, using a training regime that involves only single presentations of each stimulus and using just 24 participant networks per experiment. The model predicts that the observed behavior in infants is due to a transient form of learning that might lead to the emergence of hierarchically organized categorical structure and that the impact of labels on categorization is influenced by the perceived similarity and the sequence in which the objects are presented. The results suggest that early in development, say before 12 months old, labels need not act as invitations to form categories nor highlight the commonalities between objects, but they may play a more mundane but nevertheless powerful role as additional features that are processed in the same fashion as other features that characterize objects and object categories. (shrink)

In this paper we propose a conditional logic called IBC to represent iterated belief revision systems. We propose a set of postulates for iterated revision which are a small variant of Darwiche and Pearl''s ones. The conditional logic IBC has a standard semantics in terms of selection function models and provides a natural representation of epistemic states. We establish a correspondence between iterated belief revision systems and IBC-models. Our representation theorem does not entail Gärdenfors'' Triviality Result.

In this paper we (Laura Giordano, Nicola Olivetti and myself) propose a conditional logic to represent iterated belief revision systems. We propose a set of postulates for belief revision which are a small variant of Darwiche and Pearl's ones.The resulting conditional logic has a standard semantics in terms of selection function models, and provides a natural representation of epistemic states. A Representation Theorem establishes a correspondence between iterated belief revision systems and conditional models. Our Representation Theorem does not entail Gärdenfors' (...) Triviality Result. (shrink)