A computational model of inference during story comprehension is presented, in which story situations are represented distributively as points in a high‐dimensional “situation‐state space.” This state space organizes itself on the basis of a constructed microworld description. From the same description, causal/temporal world knowledge is extracted. The distributed representation of story situations is more flexible than Golden and Rumelhart's [Discourse Proc 16 (1993) 203] localist representation.A story taking place in the microworld corresponds to a trajectory through situation‐state space. During the (...) inference process, world knowledge is applied to the story trajectory. This results in an adjusted trajectory, reflecting the inference of propositions that are likely to be the case. Although inferences do not result from a search for coherence, they do cause story coherence to increase. The results of simulations correspond to empirical data concerning inference, reading time, and depth of processing.An extension of the model for simulating story retention shows how coherence is preserved during retention without controlling the retention process. Simulation results correspond to empirical data concerning story recall and intrusion. (shrink)

A computational model of inference during story comprehension is presented, in which story situations are represented distributively as points in a high‐dimensional “situation‐state space.” This state space organizes itself on the basis of a constructed microworld description. From the same description, causal/temporal world knowledge is extracted. The distributed representation of story situations is more flexible than Golden and Rumelhart's [Discourse Proc 16 (1993) 203] localist representation.A story taking place in the microworld corresponds to a trajectory through situation‐state space. During the (...) inference process, world knowledge is applied to the story trajectory. This results in an adjusted trajectory, reflecting the inference of propositions that are likely to be the case. Although inferences do not result from a search for coherence, they do cause story coherence to increase. The results of simulations correspond to empirical data concerning inference, reading time, and depth of processing.An extension of the model for simulating story retention shows how coherence is preserved during retention without controlling the retention process. Simulation results correspond to empirical data concerning story recall and intrusion. (shrink)

A critical notice of T. Kouromenos, G. M. Parássoglou, K. Tsantsanoglou, The Derveni Papyrus. Edited with Introduction and Commentary, Studi e Testi per il Corpus dei Papiri Filosofici Greci e Latini 13, Leo Olschki, Firenze, 2006.

Philosophers often claim that forgiveness is a paradoxical phenomenon. I here examine two of the most widespread ways of dealing with the paradoxical nature of forgiveness. One of these ways, emblematized by Aurel Kolnai, seeks to resolve the paradox by appealing to the idea of repentance. Somehow, if a wrongdoer repents, then forgiving her is no longer paradoxical. I argue that this influential position faces more problems than it solves. The other way to approach the paradox, exemplified here by the (...) work of Jacques Derrida, is just too obscure to be by itself helpful. Yet, I argue that what I take to be its spirit is on the right track. I recommend distinguishing between the definition and the justification of forgiveness, and also between forgiveness understood as a mental phenomenon and an overt, communicative act. These distinctions are not given their due in the specialized literature, and I expose the nefarious consequences of this neglect. By focusing on forgiveness as a mental phenomenon I seek to analyze the root of the talk of paradoxes which surrounds the discussion of forgiveness. Finally, I present an analysis of forgiveness as a pure mental phenomenon, and argue that this analysis is the most important step in understanding forgiveness in any other sense. While my analysis reveals interesting aspects of forgiveness, it reveals, too, that forgiveness is not quite as paradoxical after all. (shrink)

The present volume contains articles of well-known representatives of the Meaning-Text Theory (MTT) and other related linguistic theories. Founded by I. Mel'cuk and A. Zholkovsky in the sixties in Moscow, MTT soon became known in the West as a “prominent outsider” theory. The picture changed since then, though. MTT gained importance in several areas of linguistics and computational linguistics. It influenced the design of new grammar formalisms such as Dependency Tree Grammars. Also, specific parts of MTT have been directly overtaken (...) into other theories; consider, for example, the work on integrating Lexical Functions into Pustejovsky's Generative Lexicon. The present volume is a further convincing demonstration of MTT's liveliness and relevance to the field's “burning” issues. The focus of the volume is on semantics, semantic representation and relation of semantics to surface in MTT. Six out of eight articles (Polguère; Escalier & Fournier; Paducheva; St.-Germain; Beck; Bogulavsky) deal with problems related to these topics, while the last two articles of the volume (Sgall and Rambow; Joshi) throw a bridge between MTT, or, more precisely, between dependency-based theories of which MTT is one instantiation, and other linguistic theories. (shrink)

"-- M. J. Silverthorne,The Humanities Association Review Leo Strauss (1899-1973) was the Robert Maynard Hutchins Distinguished Service Professor Emeritus of ...

In Homos, he studies the historical, political, and philosophical grounds for the current distrust, within the gay community, of self-identifying moves, for the ...

This collection of Leo Abse's last essays are writings that he was working on from 2006 up to and during his final illness.

How common are corporate codes of ethics in the UK and especially among Britain's most admired companies? The author is Wicklander Professor of Professional Ethics at DePaul University, Chicago, and current President of the American Society for Business Ethics.

The essays are based on a long and intimate familiarity with the works, but the essay on Aristotle is especially important as one of Strauss's few writings on ...

A set X of nonnegative integers is computably enumerable (c.e.), also called recursively enumerable (r.e.), if there is a computable method to list its elements. Let ε denote the structure of the computably enumerable sets under inclusion, $\varepsilon = (\{W_e\}_{e\in \omega}, \subseteq)$ . We previously exhibited a first order ε-definable property Q(X) such that Q(X) guarantees that X is not Turing complete (i.e., does not code complete information about c.e. sets). Here we show first that Q(X) implies that X has (...) a certain "slowness" property whereby the elements must enter X slowly (under a certain precise complexity measure of speed of computation) even though X may have high information content. Second we prove that every X with this slowness property is computable in some member of any nontrivial orbit, namely for any noncomputable A ∈ ε there exists B in the orbit of A such that X ≤ T B under relative Turing computability (≤ T ). We produce B using the Δ 0 3 -automorphism method we introduced earlier. (shrink)

Offering an innovative approach to critical thinking, Good Reasoning Matters! identifies the essential structure of good arguments in a variety of contexts and also provides guidelines to help students construct their own effective arguments. In addition to examining the most common features of faulty reasoning--slanting, bias, propaganda, vagueness, ambiguity, and a common failure to consider opposing points of view--the book introduces a variety of argument schemes and rhetorical techniques. This edition adds material on visual arguments and more exercises.

This uniquely fascinating volume is not merely a learned treatise in historical semantics; it is itself a stupendous display of world harmony as a creed-a vivid demonstration that "all is all.".