Publications
-
The Origin Of The Binary-Search Paradigm
The paper considers how such algorithms might be derived from their specifications by an automatic program-synthesis system. The derivation of the binary-search concept has been found to be surprisingly straightforward.
-
Configurational Variation In English: A Study Of Extraposition and Related Matters
Natural languages typically permit more than one order of words or phrases, though they differ with respect to both the amount of order variation allowed and the kind of information…
-
Review of ‘The Logic of Mind’
Turing focused on the computable real numbers, not on the nature and extent of the computable functions of natural numbers. In the last two sections of the paper (plus the…
-
A Cognitivist Reply To Behaviorism
The objections to mentalistic psychology raised by Skinner are reviewed, and it is argued that a "cognitivist" perspective offers a way of constructing mentalistic theories that overcome these objections.
-
Triangle Tables: A Proposal For A Robot Programming Language
Because the rationale for triangle tables still seems relevant, I have recently elaborated the original concept and have begun to consider how the expanded formalism could be used as a…
-
A Short Companion to the Naive Physics Manifesto
-
Communication and Interaction In Multi-Agent Planning
A method for synthesizing multi-agent plans from simpler single-agent plans is described. The idea is to insert communication acts into the single-agent plans so that agents can synchronize activities and…
-
A Simple and Efficient Implementation Of Higher-Order Functions In Lisp
A relatively simple method for handling higher-order functions (funargs) in LISP is described. It is also shown how this scheme allows extension of the LISP language to include partial application…
-
The Representation Of Adverbs, Adjectives and Events In Logical Form
The representation of adjectives and their adverbial counterparts in logical form rises a number of issues in the relation of syntax to semantics, as well as more specific problems of…
-
On The Mathematical Properties Of Linguistic Theories
Metatheoretical findings regarding the decidability, generative capacity, and recognition complexity of several syntactic theories are surveyed. These include context-free, transformational, lexical-functional, generalized phrase structure, tree adjunct, and stratificational grammars.
-
Team Users Guide
This user’s guide is designed to assist new TEAM users to learn about the concepts and tasks involved in retrieving data and in preparing a demonstration for a new application…
-
Automated Deduction By Theory Resolution
Theory resolution constitutes a set of complete procedures for incorporating theories into a resolution theorem-proving program, thereby making it unnecessary to resolve directly upon axioms of the theory. This can…