Learning action strategies for planning domains

Artificial Intelligence

Volumn 113, Issue 1, 1999, Pages 125-148

  Khardon, Roni ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; FORMAL LOGIC; HEURISTIC METHODS; LEARNING ALGORITHMS; PLANNING; PROBLEM SOLVING;

DECISION LISTS; LEARNING TO ACT; STRUCTURAL DOMAINS; SUPERVISED LEARNING;

LEARNING SYSTEMS;

EID: 0033189384     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00060-0     Document Type: Article

References (48)

1. R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases, in: Proc. ACM Conference on Management of Data (SIGMOD), Washington, DC, ACM Press, 1993, pp. 207-216.
2. F. Bacchus, F. Kabanza, Using temporal logic to control search in a forward chaining planner, in: Proc. 3rd European Workshop on Planning, 1995.
3. A.G. Barto, S.J. Bradtke, A.P. Singh, Learning to act using real-time dynamic programming, Artificial Intelligence 72 (1995) 81-138.
4. P. Bickel, K. Doksum, Mathematical Statistics, Prentice-Hall, Englewood Cliffs, NJ, 1977.
5. A. Blum, M. Furst, Fast planning through planning graph analysis, in: Proc. IJCAI-95, Montreal, Quebec, 1995, pp. 1636-1642.
6. T. Bylander, The computational complexity of propositional STRIPS planning, Artificial Intelligence 69 (1994) 165-204.
7. D. Chapman, Penguins can make cake, AI Magazine 10 (4) (1989) 45-50.
8. S.V. Chenoweth, On the NP-hardness of blocks world, in: Proc. AAAI-91, Anaheim, CA, 1991, pp. 623-628.
9. P. Clark, T. Niblett, The CN2 induction algorithm, Machine Learning 3 (1989) 261-283.
10. S.A. Cook, The complexity of theorem proving procedures, in: Proc. 3rd Annual ACM Symposium on the Theory of Computing, Shaker Heights, OH, ACM Press, 1971, pp. 151-158.
11. G. DeJong, R. Mooney, Explanation based learning: An alternative view, Machine Learning 1 (1986) 145-176.
12. R.B. Doorenbos, Matching 100,000 learned rules, in: Proc. AAAI-93, Washington, DC, 1993, pp. 290-296.
13. T.A. Estlin, R.J. Mooney, Multi-strategy learning of search control for partial-order planning, in: Proc. AAAI-96, Portland, OR, 1996, pp. 843-848.
14. O. Etzioni, Acquiring search-control knowledge via static analysis, Artificial Intelligence 62 (1993) 255-301.
15. R.E. Fikes, N. Nilsson, STRIPS: A new approach to the application of theorem proving to problem solving, Artificial Intelligence 2 (1971) 189-208.
16. M. Ginsberg, Universal planning: An (almost) universally bad idea, AI Magazine 10 (4) (1989) 40-44.
17. D. Gunopulos, R. Khardon, H. Mannila, H. Toivonen, Data mining, hypergraph transversals, and machine learning, in: Proc. Symposium on Principles of Database Systems, 1997, pp. 209-216.
18. N. Gupta, D.S. Nau, Complexity results for blocks world planning, in: Proc. AAAI-91, Anaheim, CA, AAAI Press, 1991, pp. 629-633.
19. L. Kaelbling, M. Littman, A. Moore, Reinforcement learning: A survey, J. Artificial Intelligence Res. 4 (1996) 237-285.
20. H. Kautz, B. Selman, Pushing the envelope: Planning, propositional logic, and stochastic search, in: Proc. AAAI-96, Portland, OR, 1996, pp. 1194-1201.
21. M.J. Kearns, R.E. Schapire, Efficient distribution-free learning of probabilistic concepts, J. Comput. System Sci. 48 (1994) 464-497.
22. R. Khardon, L2ACT: User manual, Technical Report TR-10-97, Aiken Computation Lab., Harvard University, 1997.
23. R. Khardon, Learning to take actions, Machine Learning 35 (1) (1999) 57-90.
24. J.E. Laird, P.S. Rosenbloom, A. Newell, Chunking in soar: The anatomy of a general learning mechanism, Machine Learning 1 (1986) 11-46.
25. N. Littlestone, Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm, Machine Learning 2 (1988) 285-318.
26. H. Mannila, H. Toivonen, On an algorithm for finding all interesting sentences, in: Cybernetics and Systems, Proc. 13th European Meeting on Cybernetics and Systems Research, 1996, pp. 973-978.
27. S. Minton, Quantitative results concerning the utility of explanation based learning, Artificial Intelligence 42 (1990) 363-391.
28. T. Mitchell, Machine Learning, McGraw-Hill, New York, 1997.
29. T. Mitchell, R. Keller, S. Kedar-Cabelli, Explanation based learning: A unifying view, Machine Learning 1 (1986) 47-80.
30. S. Muggleton, L. De Raedt, Inductive logic programming: Theory and methods, J. Logic Programming 20 (1994) 626-679.
31. J.R. Quinlan, Learning logical definitions from relations, Machine Learning 5 (1990) 239-266.
32. C. Reddy, P. Tadepalli, S. Roncagliolo, Theory guided empirical speedup learning of goal decomposition rules, in: Proc. International Conference on Machine Learning, Bari, Italy, Morgan Kaufmann, San Mateo, CA, 1996, pp. 409-416.
33. R.L. Rivest, Learning decision lists, Machine Learning 2 (3) (1987) 229-246.
34. P.S. Rosenbloom, J.E. Laird, A. Newell, The Soar Papers: Research on Integrated Intelligence, MIT Press, Cambodge, MA, 1993.
35. M. Schoppers, Universal plans for reactive robots in unpredictable domains, in: Proc. IJCAI-87, Milan, Italy, Morgan Kaufmann, San Mateo, CA, 1987, pp. 1039-1046.
36. M. Schoppers, In defense of reaction plans as caches, AI Magazine 10 (4) (1989) 51-62.
37. B. Selman, Near-optimal plans, tractability, and reactivity, in: Proc. 4th International Conference on Knowledge Representation and Reasoning (KR-94), Bonn, Germany, Morgan Kaufmann, San Mateo, CA, 1994, pp. 521-529.
38. J. Slaney, S. Thiebaux, Linear time near-optimal planning in the blocks world, in: Proc. AAAI-96, Portland, OR, AAAI Press, 1996, pp. 1208-1214.
39. R.S. Sutton, Learning to predict by the methods of temporal differences, Machine Learning 3 (1) (1988) 9-44.
40. P. Tadepalli, A formalization of explanation based macro-operator learning, in: Proc. IJCAI-91, Sydney, Australia, Morgan Kaufmann, San Mateo, CA, 1991, pp. 616-622.
41. P. Tadepalli, B. Natarajan, A formal framework for speedup learning from problems and solutions, J. Artificial Intelligence Res. 4 (1996) 445-475.
42. L.G. Valiant, Learning disjunctions of conjunctions, in: Proc. IJCAI-85, Los Angeles, CA, Morgan Kaufmann, San Mateo, CA, 1985, pp. 560-566.
43. L.G. Valiant, Managing complexity in neuroidal circuits, in: Proc. 7th International Workshop on Algorithmic Learning Theory, Springer, Berlin, 1996.
44. L.G. Valiant, Neuroidal architecture for cognitive computation, in: Proc. ICALP-98, International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 1443, Springer, Berlin, 1998, pp. 642-669.
45. M. Veloso, Learning by Analogical Reasoning in General Problem Solving, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, 1992. Also appeared as Technical Report CMU-CS-92-174.
46. M. Veloso, Flexible strategy learning: Analogical replay of problem solving episodes, in: Proc. AAAI-94, Seattle, WA, 1994, pp. 595-600.
47. M. Veloso, J. Carbonell, A. Perez, D. Borrajo, E. Fink, J. Blythe, Integrating learning and planning: The PRODIGY architecture, J. Experiment. Theoret. Artificial Intelligence 7 (1) (1995) 81-120.
48. D. Weld, An introduction to least commitment planning, AI Magazine 15 (4) (1994) 27-61.