Integrating knowledge in problem solving search procedures

With the help of a model for discrete optimization problems, we show that a large number of heuristic search procedures (for searching state-space graphs, AND/OR graphs, game trees, etc.) of artificial intelligence (AI), and dynamic programming (DP) and branch-and-bound (B&B) procedures of operations research use problem-specific knowledge in a framework based upon context-free grammar. The model reveals the true nature of these procedures, and aids in synthesizing new variations as well as generalizations and parallel implementations of these procedures. The paper concludes by commenting upon how this model may be generalized and made more powerful to encompass a greater variety of problems, and to help synthesize more efficient search procedures.

[1]  Donald E. Knuth,et al.  A Generalization of Dijkstra's Algorithm , 1977, Inf. Process. Lett..

[2]  Averill M. Law,et al.  The art and theory of dynamic programming , 1977 .

[3]  Donald E. Knuth,et al.  The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.

[4]  Ranan B. Banerji,et al.  On the Relationship Between Strong and Weak Problem Solvers , 1983, AI Mag..

[5]  Avron Barr,et al.  The Handbook of Artificial Intelligence , 1982 .

[6]  Vipin Kumar,et al.  The Composite Decision Process: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch & Bound Procedures , 1983, AAAI.

[7]  Patrick A. V. Hall,et al.  Equivalence between AND/OR graphs and context-free grammars , 1973, Commun. ACM.

[8]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[9]  Vipin Kumar,et al.  General Branch and Bound, and its Relation to A and AO , 1984, Artif. Intell..

[10]  Vipin Kumar,et al.  A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures , 1983, Artif. Intell..

[11]  George C. Stockman,et al.  A Minimax Algorithm Better than Alpha-Beta? , 1979, Artif. Intell..

[12]  Vipin Kumar.  A unified approach to problem solving search procedures , 1982 .

[13]  Vipin Kumar,et al.  A General Bottom-up Procedure for Searching And/Or Graphs , 1983, AAAI.

[14]  Hans J. Berliner,et al.  The B* Tree Search Algorithm: A Best-First Proof Procedure , 1979, Artif. Intell..

[15]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[16]  Maurice Bruynooghe.  Intelligent backtracking for an interpreter of Horn clause logic programs , 1978 .

[17]  Alberto Martelli,et al.  Optimizing decision trees through heuristically guided search , 1978, CACM.

[18]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[19]  Drew McDermott,et al.  From PLANNER to CONNIVER: a genetic approach , 1972, AFIPS '72 (Fall, part II).

[20]  Barr and Feigenbaum Edward A. Avron,et al.  The Handbook of Artificial Intelligence , 1981 .

[21]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[22]  Vipin Kumar,et al.  Parallel Branch-and-Bound Formulations for AND/OR Tree Search , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[23]  M. Held,et al.  Finite-State Processes and Dynamic Programming , 1967 .

[24]  Toshihide Ibaraki,et al.  Branch-and-Bound Procedure and State-Space Representation of Combinatorial Optimization Problems , 1978, Inf. Control..

[25]  Alberto Martelli,et al.  Additive AND/OR Graphs , 1973, IJCAI.

[26]  Michael O. Rabin.  Theoretical Impediments to Artificial Intelligence , 1974, IFIP Congress.

[27]  Jack Minker,et al.  Intelligent Control Using Integrity Constraints , 1983, AAAI.

[28]  優 喜連川,et al.  The fifth generation computer : the Japanese challenge , 1985 .

[29]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.