Accession Number:

ADA067546

Title:

Automatic Discovery of Heuristics for Non-Deterministic Programs.

Corporate Author:

NEW YORK UNIV N Y COURANT INST OF MATHEMATICAL SCIENCES

Report Date:

1979-01-01

Abstract:

During the last few years a number of relatively effective AI programs have been written incorporating considerable amounts of problem specific knowledge. Consequently, the problem of encoding such knowledge in a useful form has emerged as one of the central problems of AI. In particular, Declarative representations of knowledge have attracted much attention partly because of the relative ease with which knowledge can be communicated in this form. Unfortunately, implementation of Declaratively specified knowledge corresponds to a non-deterministic program which incurs enormous computational costs. This paper discusses one way to limit this cost. The approach we take is to develop control heuristics for a family of problems from traces of sample solutions generated during a training session with a human expert. Algorithms have been developed which recognize a predefined set of patterns in the sequence of knowledge applications and which compile descriptions of these patterns in a control language, called CRAPS. More specifically, patterns of repeating, parallel and common sequences are considered in the analysis. The CRAPS descriptions generated are then used for guidance in solving subsequent problems. We discusss the utility of such an approach and give an example of a generated CRAPS description. Author

Descriptive Note:

Technical rept.,

Pages:

0035

Subject Categories:

Communities Of Interest:

Modernization Areas:

Distribution Statement:

Availability: Document partially illegible.

Contract Number:

N00014-75-C-0571

File Size:

18.17MB