CARPS: A Program which Solves Calculus Word Problems

A program was written to solve calculus word problems. The program, CARPS (CALculus Rate Problem Solver), is restricted to rate problems. The overall plan of the program is similar to Bobrow's STUDENT, the primary difference being the introduction of "structures" as the internal model in CARPS. Structures are stored internally as trees. Each structure is designed to hold the information gathered about one object. A description of CARPS is given by working through two problems, one in great detail. Also included is a critical analysis of STUDENT.

SIR: A Computer Program for Semantic Information Retrieval

SIR is a computer system, programmed in the LISP language, which accepts information and answers questions expressed in a restricted form of English. This system demonstrates what can reasonably be called an ability to "understand" semantic information. SIR's semantic and deductive ability is based on the construction of an internal model, which uses word associations and property lists, for the relational information normally conveyed in conversational statements. A format-matching procedure extracts semantic content from English sentences. If an input sentence is declarative, the system adds appropriate information to the model. If an input sentence is a question, the system searches the model until it either finds the answer or determines why it cannot find the answer. In all cases SIR reports its conclusions. The system has some capacity to recognize exceptions to general rules, resolve certain semantic ambiguities, and modify its model structure in order to save computer memory space. Judging from its conversational ability, SIR, is a first step toward intelligent man-machine communication. The author proposes a next step by describing how to construct a more general system which is less complex and yet more powerful than SIR. This proposed system contains a generalized version of the SIR model, a formal logical system called SIR1, and a computer program for testing the truth of SIR1 statements with respect to the generalized model by using partial proof procedures in the predicate calculus. The thesis also describes the formal properties of SIR1 and how they relate to the logical structure of SIR.

Compositional model repositories via dynamic constraint satisfaction with order-of-magnitude preferences

J. Keppens and Q. Shen. Compositional model repositories via dynamic constraint satisfaction with order-of-magnitude preferences. Journal of Artificial Intelligence Research, 21:499-550, 2004.

A Want of Order and Good Discipline: Rules, Discretion and the Victorian Prison

null RAE2008

Worlds in Collision: Terror and the Future of Global Order

Booth, Ken, Dunne, T., Worlds in Collision: Terror and the Future of Global Order (New York: Palgrave Macmillan, 2002), pp.x+376 RAE2008

Iraq and world order: a Turkish perspective

G?l, Ayla. 'Iraq and world order: a Turkish perspective', in: 'The Iraq Crisis and World Order: Structural, Institutional and Normative Challenges', (Eds) Thakur, R., Sidhu, W. P. S., United Nations University Press, Hong Kong , pp.114-133, 2006 RAE2008

One Order, Two Laws: Recovering the 'Normative' in English School Theory

Bain, William, 'One Order, Two Laws: Recovering the 'Normative' in English School Theory', Review of International Studies, (2007) 33(4) pp.557-575 RAE2008

Inelastic neutron scattering on sodium aluminosilicate melts: sodium diffusion and intermediate range order

Kargl, Florian; Meyer, A., (2004) 'Inelastic neutron scattering on sodium aluminosilicate melts: sodium diffusion and intermediate range order', Chemical Geology 213(1-3) pp.165-172 RAE2008

Channel formation and intermediate range order in sodium silicate melts and glasses

Kargl, Florian; Meyer, A.; Horbach, J.; Kob, W., (2004) 'Channel formation and intermediate range order in sodium silicate melts and glasses', Physical Review Letters 93(2) pp.027801 RAE2008

Frequency of word-use predicts rates of lexical evolution throughout Indo-European history

Mark Pagel, Quentin D. Atkinson & Andrew Meade (2007). Frequency of word-use predicts rates of lexical evolution throughout Indo-European history. Nature, 449,717-720. RAE2008

Electronic dictionary entries with animated pictures: Lookup preferences and word retention

http://ijl.oxfordjournals.org/cgi/reprint/ecp022?ijkey=FWAwWPvILuZDT1S&keytype=ref

Bowling Together: Congregations and the American Civic Order

Arizona State University Annual Religion Lecture: 1996

The life of Rev. David Brainerd, chiefly extracted from his diary. By President Edwards. Somewhat abridged. Embracing, in the chronological order, Brainerd's public journal of the most successful year of his missionary labors.

http://www.archive.org/details/lifeofrevdavidbr00braiiala

Fixed Point vs. First-Order Logic on Finite Ordered Structures with Unary Relations

We prove that first order logic is strictly weaker than fixed point logic over every infinite classes of finite ordered structures with unary relations: Over these classes there is always an inductive unary relation which cannot be defined by a first-order formula, even when every inductive sentence (i.e., closed formula) can be expressed in first-order over this particular class. Our proof first establishes a property valid for every unary relation definable by first-order logic over these classes which is peculiar to classes of ordered structures with unary relations. In a second step we show that this property itself can be expressed in fixed point logic and can be used to construct a non-elementary unary relation.

A Characterization of First-Order Definable Subsets on Classes of Finite Total Orders

We give an explicit and easy-to-verify characterization for subsets in finite total orders (infinitely many of them in general) to be uniformly definable by a first-order formula. From this characterization we derive immediately that Beth's definability theorem does not hold in any class of finite total orders, as well as that McColm's first conjecture is true for all classes of finite total orders. Another consequence is a natural 0-1 law for definable subsets on finite total orders expressed as a statement about the possible densities of first-order definable subsets.