Artificial intelligence publications

A technique for unifying spatial and temporal analysis of an image sequence taken by a camera moving in a straight line is presented. The technique is based on a "dense"…

Any intelligent system that operates in a moderately complex or unpredictable environment must be reactive — that is, it must respond dynamically to changes in its environment. A robot that…

The bulk of the paper presents both problems encountered during the process of encoding this domain, and extensions of the planning system that were made to solve them.

In which the author expresses general skepticism about proposals for a trouble free marriage of AI Knowledge Bases and Databases (narrowly and tendentiously construed.) The author argues, as well, against a shotgun wedding.

It is widely agreed that any reasonable AI system has to reason. Once it is agreed why that must be so, one can go on to look at alternative conceptions of what reasoning consist…

This paper presents a general criterion for measuring the degree to which any given theory can be considered a good explanation of a particular body of data. A formal definition…

There is considerable ambiguity involved in hierarchical planning. We present a definition of the latter, and examine several of the reasons for this confusion.

Following an approach suggested by Georgeff, this paper considers the use of synchronizing primitives to resolve conflicts and produce a plan that is as unrestrictive as possible.  In a sense,…

This report discusses a new approach to the specification of properties of multiagent environment and the generation of plans for such domains.

Here I propose an approach that I call it experimental robot psychology because it involves formalizing and reasoning about the design of existing robot agents. It shows promise of yielding…

The machine is regarded as knowing a fact if its state either explicitly encodes the fact as a sentence of an interpreted formal language or if such a sentence can…

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.