Children's predictions of consistency in people's actions

Past research suggests that young children are often reluctant to generalize about people's behavior. Three experiments involving 102 4-5-year-olds, 84 7-8-year-olds, and 107 adults explored the conditions under which inductive inferences about people are made. There was an age-based increase in propensity to predict consistency in psychological/intentional causal relations. Children often predicted change; people would behave differently in the future than they did in the past. Younger children limited predictions of consistency to non-psychological contexts. Older children showed some appreciation of stable motivations (e.g. traits, preferences). The results are consistent with the hypothesis that children's theories of mind emphasize situational influences, with personal influences appearing in middle-childhood.     

Entailment with Near Surety of Scaled Assertions of High Conditional Probability

An assertion of high conditional probability or, more briefly, an HCP assertion is a statement of the type: The conditional probability of B given A is close to one. The goal of this paper is to construct logics of HCP assertions whose conclusions are highly likely to be correct rather than certain to be correct. Such logics would allow useful conclusions to be drawn when the premises are not strong enough to allow conclusions to be reached with certainty. This goal is achieved by taking Adams" (1966) logic, changing its intended application from conditionals to HCP assertions, and then weakening its criterion for entailment. According to the weakened entailment criterion, called the Criterion of Near Surety and which may be loosely interpreted as a Bayesian criterion, a conclusion is entailed if and only if nearly every model of the premises is a model of the conclusion. The resulting logic, called NSL, is nonmonotonic. Entailment in this logic, although not as strict as entailment in Adams" logic, is more strict than entailment in the propositional logic of material conditionals. Next, NSL was modified by requiring that each HCP assertion be scaled; this means that to each HCP assertion was associated a bound on the deviation from 1 of the conditional probability that is the subject of the assertion. Scaling of HCP assertions is useful for breaking entailment deadlocks. For example, it it is known that the conditional probabilities of C given A and of ¬ C given B are both close to one but the bound on the former"s deviation from 1 is much smaller than the latter"s, then it may be concluded that in all likelihood the conditional probability of C given A B is close to one. The resulting logic, called NSL-S, is also nonmonotonic. Despite great differences in their definitions of entailment, entailment in NSL is equivalent to Lehmann and Magidor"s rational closure and, disregarding minor differences concerning which premise sets are considered consistent, entailment in NSL-S is equivalent to entailment in Goldszmidt and Pearl"s System-Z ⁺. Bacchus, Grove, Halpern, and Koller proposed two methods of developing a predicate calculus based on the Criterion of Near Surety. In their random-structures method, which assumed a prior distribution similar to that of NSL, it appears possible to define an entailment relation equivalent to that of NSL. In their random-worlds method, which assumed a prior distribution dramatically different from that of NSL, it is known that the entailment relation is different from that of NSL.     

Likelihood inference on the underlying structure of IRT models

The assumptions underlying item response theory (IRT) models may be expressed as a set of equality and inequality constraints on the parameters of a latent class model. It is well known that the same assumptions imply that the parameters of the manifest distribution have to satisfy a more complicated set of inequality constraints which, however, are necessary but not sufficient. In this paper, we describe how the theory for likelihood-based inference under equality and inequality constraints may be used to test the underlying assumptions of IRT models. It turns out that the analysis based directly on the latent structure is simpler and more flexible. In particular, we indicate how several interesting extensions of the Rasch model may be obtained by partial relaxation of the basic constraints. An application to a data set provided by Educational Testing Service is used to illustrate the approach.We thank Dr. Gorman and Dr. Rogers of the Educational Testing Service for providing the data analyzed in Section 4. We also thank three reviewers for comments and suggestions.This revised article was published online in August 2005 with the PDF paginated correctly.     

Experience and inference: how far will science carry us?

This paper begins with a view of the remarkable understanding of infant and child development that has evolved from research and observation. The limitations of this contribution from science to the multi-dimensional context-based individuality of each human in his or her intersubjective realm are then considered. For a contemporary view we must recognize the influence of the variability of experiences and the inferences drawn from them. Inferences involve symbolization and culturally derived archetypes as illustrated in a clinical example.     

When Hyperpropositions Meet ...

With each proposition P we associate a set of proposition (a hyperproposition) which determines the order in which one may retreat from accepting P, if one cannot fully hold on to P. We first describe the structure of hyperpropositions. Then we describe two operations on propositions, subtraction and merge, which can be modelled in terms of hyperpropositions. Subtraction is an operation that takes away part of the content of a proposition. Merge is an operation that determines the maximal consistent content of two propositions considered jointly. The merge operation gives rise to an inference relation which is, in a certain sense, optimally paraconsistent.     

Deductivism Within Pragma-Dialectics

The present paper elaborates a deductivist account of natural language argu-ment in the context of pragma-dialectics. It reviews earlier debates, criticizes some standard misconceptions in the literature, and argues that the identification and analysis of deductive argument schemes can be the basis of a compelling theory of argumentative discourse.     

Training requirements and retention characteristics of serial list organization by macaque monkeys

This work evaluated the prospect that organizational accounts of the retention of list information by monkeys might be an artifact of familiarity with conditional relationships. Seven sophisticated macaques were trained on four five-item lists. Each acquisition selectively excluded one of the internal conditional pairs of the typical four-problem sequence (AB,BC,CD,DE) that defines a five-item serially ordered list. Then, all possible novel pairings and the trained pairs appeared together in a test. After this, the previously omitted pair was trained and animals were retested. On all tasks, initial tests revealed little organization and much intersubject variability of characteristic choice strategies, but subsequent inclusion of all four conditional pairs always yielded organized serial choice. On both the four-problem tests and in a later retention, errors were directly related to interitem distance between the objects paired on test trials. These results helped to specify the conditions required for demonstration of non-human primate analogs of transitivity, and showed that even sophisticated monkeys organize information in retention only if they know all interitem relationships. Received: 7 October 1998 / Accepted after revision: 10 October 1999