Author: SRI International

  • 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…

  • Evidence Against The Context-Freeness Of Natural Language

    Soon after Chomsky’s categorization of languages into his well-known hierarchy, the common conception of the context-free class of languages as a tool for describing natural languages was that it was too restrictive a class–interpreted strongly and even weakly.

  • 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.

  • 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.

  • An AI Approach to the Integration of Information

    This paper discusses the use of artificial intelligence techniques for integrating multi-source information in the process of assessing and understanding an ongoing situation.

  • Purification and Properties of iV-Acetylneuraminate Lyase from Escherichia coli

    The enzyme could be used for the enzymatic determination of sialic acid; reaction conditions were devised for determining the bound form of sialic acid by coupling neuraminidase from Arthrobacter ureafaciens, lactate dehydrogenase, and NADH.

  • Fractal-Based Description Of Natural Scenes

    This paper addresses the problems of: representing natural shapes such as mountains, trees, and clouds, and computing their description from image data.

  • A Prolog Technology Theorem Prover

    An extension of Prolog, based on the model elimination theorem-proving procedure, would permit production of a logically complete Prolog technology theorem prover capable of performing inference operations at a rate approaching that of Prolog itself.

  • Artificial Intelligence, Employment, and Income

    Some claim that AI is not really very different from other technologies that have supported automation and increased productivity–technologies such as mechanical engineering, electronics, control engineering, and operations research.

  • Probabilistic Logic

    The method described in the present paper combines logic with probability theory in such a way that probabilistic logical entailment reduces to ordinary logical entailment when the probabilities of all sentences are either 0 or 1.

  • A Formal Theory Of Knowledge and Action

    Most work on planning and problem solving within the field of artificial intelligence assumes that the agent has complete knowledge of all relevant aspects of the problem domain and problem situation. In the real world, however, planning and acting must frequently be performed without complete knowledge. This imposes two additional burdens on an intelligent agent…

  • Some Remarks on the Semantics of Representation Languages

    It has been said many times that semantic nets are mere notational variants of predicate calculus. But before we lay down our nets, we ought at least to be clear about what predicate calculus is.