Automatically generating abstractions for problem solving

Abstract : A major source of inefficiency in automated problem solvers is their inability to decompose problems and work on the more difficult parts first. This issue can be addressed by employing a hierarchy of abstract problem spaces to focus the search. Instead of solving a problem in the original problem space, a problem is first solved in an abstract space, and the abstract solution is then refined at successive levels in the hierarchy. While this use of abstraction can significantly reduce search, it is often difficult to find good abstractions, and the abstractions must be manually engineered by the designer of a problem domain.

[1]  E. M. Hartwell.  Boston , 1906 .

[2]  H. Simon,et al.  The Processes of Creative Thinking , 1959 .

[3]  I. G. BONNER CLAPPISON.  Editor , 1960, The Electric Power Engineering Handbook - Five Volume Set.

[4]  J. McCarthy.  A Tough Nut for Proof Procedures , 1964 .

[5]  Saul Amarel,et al.  On representations of problems of reasoning about actions , 1968 .

[6]  George W. Ernst.  Sufficient Conditions for the Success of GPS , 1969, JACM.

[7]  James Wong.  COMPUTER SCIENCE DEPARTMENT , 1971 .

[8]  Herbert A. Simon,et al.  The Theory of Problem Solving , 1971, IFIP Congress.

[9]  George W. Ernst,et al.  GPS : a case study in generality and problem solving , 1971 .

[10]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[11]  Richard Fikes,et al.  Learning and Executing Generalized Robot Plans , 1993, Artif. Intell..

[12]  Earl D. Sacerdoti,et al.  Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.

[13]  Allen Newell,et al.  Human Problem Solving. , 1973 .

[14]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

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

[16]  Earl David Sacerdoti,et al.  A Structure for Plans and Behavior , 1977 .

[17]  Michael Milan Goldstein.  The mechanical discovery of problem solving strategies. , 1978 .

[18]  H A Simon,et al.  The theory of learning by doing. , 1979, Psychological review.

[19]  Richard E. Korf,et al.  Toward a Model of Representation Changes , 1980, Artif. Intell..

[20]  Stanley J. Rosenschein,et al.  Plan Synthesis: A Logical Perspective , 1981, IJCAI.

[21]  David A. Plaisted,et al.  Theorem Proving with Abstraction , 1981, Artif. Intell..

[22]  Mark Stefik,et al.  Planning with Constraints (MOLGEN: Part 1) , 1981, Artif. Intell..

[23]  John P. McDermott,et al.  R1: A Rule-Based Configurer of Computer Systems , 1982, Artif. Intell..

[24]  George W. Ernst,et al.  Mechanical Discovery of Classes of Problem-Solving Strategies , 1982, JACM.

[25]  Denis Johnson.  In Palo Alto , 1982 .

[26]  Saul Amarel.  Expert behaviour and problem representations , 1984 .

[27]  David E. Wilkins,et al.  Domain-Independent Planning: Representation and Plan Generation , 1984, Artif. Intell..

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

[29]  David Kelley.  A theory of abstraction. , 1984 .

[30]  Jesfis Peral,et al.  Heuristics -- intelligent search strategies for computer problem solving , 1984 .

[31]  Allen Newell,et al.  R1-Soar: An Experiment in Knowledge-Intensive Programming in a Problem-Solving Architecture , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[32]  E. KorfRichard.  Depth-first iterative-deepening: an optimal admissible tree search , 1985 .

[33]  Richard E. Korf,et al.  Macro-Operators: A Weak Method for Learning , 1985, Artif. Intell..

[34]  Steven Minton,et al.  Selectively Generalizing Plans for Problem-Solving , 1985, IJCAI.

[35]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[36]  Dennis Kibler,et al.  Generation of heuristics by transforming the problem representation , 1985 .

[37]  David E. Wilkins.  High-Level Planning in a Mobile Robot Domain (Preprint) , 1986 .

[38]  Vladimir Lifschitz,et al.  ON THE SEMANTICS OF STRIPS , 1987 .

[39]  Jie Cheng,et al.  Subgoal Ordering and Goal Augmentation for Heuristic Problem Solving , 1987, IJCAI.

[40]  Richard E. Korf,et al.  Planning as Search: A Quantitative Approach , 1987, Artif. Intell..

[41]  Allen Newell,et al.  SOAR: An Architecture for General Intelligence , 1987, Artif. Intell..

[42]  Devika Subramanian,et al.  The Relevance of Irrelevance , 1987, IJCAI.

[43]  David E. Wilkins,et al.  Practical planning - extending the classical AI planning paradigm , 1989, Morgan Kaufmann series in representation and reasoning.

[44]  Jaime G. Carbonell,et al.  Learning effective search control knowledge: an explanation-based approach , 1988 .

[45]  David Ruby,et al.  Learning Subgoal Sequences for Planning , 1989, IJCAI.

[46]  Jack Mostow,et al.  Discovering Admissible Heuristics by Abstracting and Optimizing: A Transformational Approach , 1989, IJCAI.

[47]  Oren Etzioni,et al.  Explanation-Based Learning: A Problem Solving Perspective , 1989, Artif. Intell..

[48]  J. Bennington.  “Milan” , 1989 .

[49]  Nicholas S. Flann.  Learning Appropriate Abstractions for Planning in Formation Problems , 1989, ML.

[50]  Kurt VanLehn.  Discovering Problem Solving Strategies: What Humans Do and Machines Don't (Yet) , 1989, ML.

[51]  Jie Cheng,et al.  Ordering Problem Subgoals , 1989, IJCAI.

[52]  John W. Roach,et al.  A Theoretical Analysis of Conjunctive-Goal Problems , 1989, Artif. Intell..

[53]  Jaime G. Carbonell,et al.  Towards a General Framework for Composing Disjunctive and Iterative Macro-operators , 1989, IJCAI.

[54]  Craig A. Knoblock.  Learning Abstraction Hierarchies for Problem Solving , 1990, AAAI.

[55]  H. Altay Güvenir,et al.  Learning Problem Solving Strategies Using Refinement and Macro Generation , 1990, Artif. Intell..

[56]  Craig A. Knoblock,et al.  A Theory of Abstraction for Hierarchical Planning , 1990 .

[57]  Qiang Yang,et al.  ABTWEAK: Abstracting a Nonlinear, Least Commitment Planner , 1990, AAAI.

[58]  Qiang Yang,et al.  Solving the problem of hierarchical inaccuracy in planning , 1990 .

[59]  Jaime G. Carbonell,et al.  Learning by experimentation: the operator refinement method , 1990 .

[60]  David E. Wilkins,et al.  Can AI planners solve practical problems? , 1990, Comput. Intell..

[61]  Patricia Riddle,et al.  Automating Problem Reformulation , 1990 .

[62]  Leo Dorst,et al.  An Introduction to the Decomposition of Task Representations in Autonomous Systems , 1990 .

[63]  Steven Minton,et al.  Quantitative Results Concerning the Utility of Explanation-based Learning , 1988, Artif. Intell..

[64]  Oren Etzioni,et al.  Integrating Abstraction and Explanation-Based Learning in PRODIGY , 1991, AAAI.

[65]  Oren Etzioni,et al.  PRODIGY: an integrated architecture for planning and learning , 1991, SGAR.

[66]  Qiang Yang,et al.  Characterizing Abstraction Hierarchies for Planning , 1991, AAAI.

[67]  Craig A. Knoblock.  Search Reduction in Hierarchical Problem Solving , 1991, AAAI.

[68]  Oren Etzioni,et al.  PRODIGY4.0: The Manual and Tutorial , 1992 .

[69]  Jaime G. Carbonell,et al.  Derivational analogy: a theory of reconstructive problem solving and expertise acquisition , 1993 .

[70]  Amy Unruh,et al.  Two new weak method increments for abstraction , 1993 .