SRI International
-
An Inductive Approach To Figural Perception
An inductive approach consisting of two parts is presented. The first involves a scheme for describing the shapes of curves and surfaces and the second relies on a criterion for deciding which description is to be preferred.
-
A Fast Surface Interpolation Technique
A method for interpolating a surface through 3-D data is presented. The method is computationally efficient and general enough to allow the construction of surfaces with either smooth or rough texture.
-
A Deduction Model Of Belief and Its Logics
This report is a slightly revised version of a thesis submitted to the Department of Computer Science at Stanford University in June 1984, in partial fulfillment of the requirements for the degree of Doctor of Philosophy.
-
Possible-World Semantics For Autoepistemic Logic
This note presents an alternative, possible-world semantics for autoepistemic logic that enables us to construct finite models for autoepistemic theories, as well as to demonstrate the existence of sound and complete autoepistemic theories based on given sets of premises.
-
Evaluation Of Scene-Analysis Algorithms
A software evaluation methodology has been developed at SRI International for evaluating contributions to the ARPA/DMA Image Understanding Testbed. This paper describes the criteria that have shaped the evaluation methodology.
-
An AI Approach to Information Fusion
-
Image-To-Image Correspondence: Linear-Structure Matching
We examine the task of matching images of a scene when they are taken from very different vantage points, when there is considerable scale change, and when the image orientations are unknown.
-
The Role Of Logic In Artificial Intelligence
This paper surveys three possible applications of logic in AI: as an analytical tool, as a knowledge representation formalism, and as a programming language.
-
Belief and Incompleteness
Two artificially intelligent (AI) computer agents begin to play a game of chess, and the following conversation ensues: S1: Do you know the rules of chess? S2: Yes. S1: Then you know whether White has a forced initial win or not. S2: Upon reflection, I realize that I must. S1: Then there is no reason…
-
Reasoning About Control: An Evidential Approach
We present an alternative evidentially-based approach to reasoning about control that enables us to reason from limited and imperfect information; to partition bodies of meta- and domain-knowledge into modular components; and to order potential actions flexibly by allowing any number of constraints to be imposed over a set of alternative actions.
-
Sublanguage and Knowledge
The work described in this paper has been carried out as a part of a project to build a system for natural language access to a computerized medical textbook on hepatitis.
-
Notes From The Unification Underground: A Compilation Of Papers On Unification-Based Grammar Formalisms
The current formalism being simultaneously designed, implemented and used by the group, PATR-II, is based on unification of directed-graph structures. Unification is thus a theme both of our research, and of the papers reproduced in this volume.