Taxonomic Syntax for First-Order Inference

Most knowledge representation languages are based on classes and taxonomic relationships between classes. Taxonomic hierarchies without defaults or exceptions are semantically equivalent to a collection of formulas in first order predicate calculus. Although designers of knowledge representation languages often express an intuitive feeling that there must be some advantage to representing facts as taxonomic relationships rather than first order formulas, there are few, if any, technical results supporting this intuition. We attempt to remedy this situation by presenting a taxonomic syntax for first order predicate calculus and a series of theorems that support the claim that taxonomic syntax is superior to classical syntax.

Natural Language Syntax and First Order Preference

We have argued elsewhere that first order inference can be made more efficient by using non-standard syntax for first order logic. In this paper we show how a fragment of English syntax under Montague semantics provides the foundation of a new inference procedure. This procedure seems more effective than corresponding procedures based on either classical syntax of our previously proposed taxonomic syntax. This observation may provide a functional explanation for some of the syntactic structure of English.

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

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

Spontaneous DC Current Generation in a Resistively Shunted Semiconductor Superlattice Driven by a TeraHertz Field

We study a resistively shunted semiconductor superlattice subject to a high-frequency electric field. Using a balance equation approach that incorporates the influence of the electric circuit, we determine numerically a range of amplitude and frequency of the ac field for which a dc bias and current are generated spontaneously and show that this region is likely accessible to current experiments. Our simulations reveal that the Bloch frequency corresponding to the spontaneous dc bias is approximately an integer multiple of the ac field frequency.

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.

Typability and Type Checking in the Second-Order Λ-Calculus Are Equivalent and Undecidable (Preliminary Draft)

We consider the problems of typability[1] and type checking[2] in the Girard/Reynolds second-order polymorphic typed λ-calculus, for which we use the short name "System F" and which we use in the "Curry style" where types are assigned to pure λ -terms. These problems have been considered and proven to be decidable or undecidable for various restrictions and extensions of System F and other related systems, and lower-bound complexity results for System F have been achieved, but they have remained "embarrassing open problems"[3] for System F itself. We first prove that type checking in System F is undecidable by a reduction from semi-unification. We then prove typability in System F is undecidable by a reduction from type checking. Since the reverse reduction is already known, this implies the two problems are equivalent. The second reduction uses a novel method of constructing λ-terms such that in all type derivations, specific bound variables must always be assigned a specific type. Using this technique, we can require that specific subterms must be typable using a specific, fixed type assignment in order for the entire term to be typable at all. Any desired type assignment may be simulated. We develop this method, which we call "constants for free", for both the λK and λI calculi.