Accession Number : ADA294862

Title :   Plan Debugging Using Approximate Domain Theories.

Descriptive Note : Final rept. Feb 91-Nov 94,

Corporate Author : STANFORD UNIV CA

Personal Author(s) : Ginsberg, Matthew L.

PDF Url : ADA294862

Report Date : MAR 1995

Pagination or Media Count : 159

Abstract : The overall goal of this project was to investigate the idea that planning in the presence of uncertain information could be easier, not harder, than planning in its absence. The basic reason proposed was that, since it is impossible to control planning search with precision, uncertain domain information had a potential for use in this area that more accurate information might lack. This suggestion turned out to be correct. During the course of the project, we developed compelling theoretical arguments showing that reasoning can be controlled more generally by using uncertain domain information than by using existing techniques such as hierarchy. Doing so, however, involves surmounting substantial practical difficulties in terms of both the underlying planning technology and our ability to manipulate uncertain information itself. This report describes these theoretical arguments and the problems (and potential solutions) that an implementation exploiting our ideas must face. (AN)

Descriptors :   *ARTIFICIAL INTELLIGENCE, *DEBUGGING(COMPUTERS), DATA BASES, ALGORITHMS, DECISION MAKING, DATA MANAGEMENT, REAL TIME, REASONING, COMPUTER LOGIC, COMPUTER PROGRAMMING, PROGRAMMING LANGUAGES, SEMANTICS, ACCURACY, PROBLEM SOLVING, SOLUTIONS(GENERAL), PLANNING, SEARCHING, HEURISTIC METHODS, KNOWLEDGE BASED SYSTEMS, CONTROL THEORY, HIERARCHIES, SYNTAX.

Subject Categories : Computer Programming and Software
      Cybernetics

Distribution Statement : APPROVED FOR PUBLIC RELEASE