Search
Now showing items 3391-3400 of 4210
Test Programming by Program Composition and Symbolic Simulation
(MIT Artificial Intelligence Laboratory, 1985-11)
Classical test generation techniques rely on search through gate-level circuit descriptions, which results in long runtimes. In some instances, classical techniques cannot be used because they would take longer than the ...
Construction and Refinement of Justified Causal Models Through Variable-Level Explanation and Perception, and Experimenting
(MIT Artificial Intelligence Laboratory, 1985-12)
The competence being investigated is causal modelling, whereby the behavior of a physical system is understood through the creation of an explanation or description of the underlying causal relations.
After developing a ...
Transcendence, Facticity, and Modes of Non-Being
(MIT Artificial Intelligence Laboratory, 1986-03)
Research in artificial intelligence has yet to satisfactorily address the primordial fissure between human consciousness and the material order. How is this split reconciled in terms of human reality? By what duality is ...
Automated Program Recognition: A Proposal
(MIT Artificial Intelligence Laboratory, 1985-12)
The key to understanding a program is recognizing familiar algorithmic fragments and data structures in it. Automating this recognition process will make it easier to perform many tasks which require program understanding, ...
Cognitive Cliches
(MIT Artificial Intelligence Laboratory, 1986-04)
This paper is an exploration of a wide class of mental structures called cognitive cliches that support intermediate methods that are moderately general purpose, in that a few of them will probably be applicable to any ...
IDEME: A DBMS of Methods
(MIT Artificial Intelligence Laboratory, 1985-08)
In this paper, an intelligent database management system (DBMS) called IDEME is presented. IDEME is a program that takes as input a task specification and finds a set of methods potentially relevant to solving that task. ...
Jordan Form of (i+j over j) over Z[subscript p]
(MIT Artificial Intelligence Laboratory, 1985-07)
The Jordan Form over field Z[subscript p] of J[superscript p][subscript p]n is diagonal for p > 3 with characteristic polynomial, ϕ(x) = x[superscript 3] - 1, for p prime, n natural number. These matrices have dimension ...
Vision Utilities
(MIT Artificial Intelligence Laboratory, 1985-12)
This paper documents a collection of Lisp utilities which I have written while doing vision programming on a Symbolics Lisp machine. Many of these functions are useful both as interactive commands invoked from the Lisp ...
Exact Algorithms for the Canadian Traveller Problem on Paths and Trees
(2008-01-28)
The Canadian Traveller problem is a stochastic shortest paths problem in which one learns the cost of an edge only when arriving at one of its endpoints. The goal is to find an adaptive policy (adjusting as one learns more ...
Writing and Representation
(MIT Artificial Intelligence Laboratory, 1988-09)
This paper collects several notes I've written over the last year in an attempt to work through my dissatisfactions with the ideas about representation I was taught in school. Among these ideas are the notion of a 'world ...