Using knowledge generated in heuristic search for nonchronological backtracking

Problem solvers that use heuristics to guide choices often run into untenable situations that can be characterized as overconstrained. When this happens, the problem must be able to identify the right culprit from among its heuristic choices in order to avoid a potentially explosive search. In this paper, we present a solution to this for a certain class of problems where the justifications associated with choice points involve an explicit assessment of the pros and cons of choosing each alternative relative to its competitors. We have designed a problem solver that accumulates such knowledge about the pros and cons of alternative selections at choice points during heuristic search, which it updates in light of an evolving problem situation. Whenever untenable situations arise, this preserved knowledge is used to determine the most appropriate backtracking point. By endowing the backtracker with access to this domain‐specific knowledge, a highly contextual approach to reasoning in backtracking situations can be achieved.

[1]  Gerald J. Sussman,et al.  Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..

[2]  K. Arrow Alternative Approaches to the Theory of Choice in Risk-Taking Situations , 1951 .

[3]  James W. Goodwin,et al.  A Process Theory of Non-monotonic Inference , 1985, IJCAI.

[4]  Jon Doyle,et al.  AMORD explicit control of reasoning , 1977, SIGART Newsl..

[5]  Paul R. Cohen,et al.  Progress report on the theory of endorsements: a heuristic approach to reasoning about uncertainty , 1984 .

[6]  Charles M. Eastman,et al.  Automated Space Planning , 1973, Artif. Intell..

[7]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[8]  Herbert A. Simon,et al.  The Structure of Ill Structured Problems , 1973, Artif. Intell..

[9]  Vasant Dhar,et al.  Planet : an intelligent decision support system for the formulation and investigation of formal planning models , 1984 .

[10]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[11]  J. Gaschnig Performance measurement and analysis of certain search algorithms. , 1979 .

[12]  D. Knuth Estimating the efficiency of backtrack programs. , 1974 .

[13]  Mark Jeffrey Stefik Planning with constraints , 1980 .

[14]  Jon Doyle,et al.  A Truth Maintenance System , 1979, Artif. Intell..

[15]  Johan de Kleer,et al.  Choices Without Backtracking , 1984, AAAI.

[16]  J. Dekleer An assumption-based TMS , 1986 .

[17]  Vasant Dhar,et al.  An Approach to Dependency Directed Backtracking Using Domain Specific Knowledge , 1985, IJCAI.

[18]  Alan K. Mackworth Consistency in Networks of Relations , 1977, Artif. Intell..