Learning to take actions

Machine Learning

Volumn 35, Issue 1, 1999, Pages 57-90

  Khardon, Roni ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; DECISION THEORY; HIERARCHICAL SYSTEMS; KNOWLEDGE BASED SYSTEMS; LEARNING ALGORITHMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES;

DYNAMIC STOCHASTIC DOMAINS; HIERARCHICAL LEARNING; SUPERVISED LEARNING;

LEARNING SYSTEMS;

EID: 0032649290     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007571119753     Document Type: Article

References (83)

1. Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. Proceedings of the ACM Conference on Management of Data (SIGMOD) (pp. 207-216). Washington, DC: ACM Press.
2. Allen, J., Hendler, J., & Tate, A. (1990). Readings in planning. San Mateo, CA: Morgan Kaufmann.
3. Anderson, J. (1983). The architecture of cognition. Cambridge, MA: Harvard University Press.
4. Angluin, D. (1987). Learning regular sets from queries and counterexamples. Information and Computation, 75, 87-106.
5. Baum, E. (1996). Toward a model of mind as a laissez-faire economy of idiots. Proceedings of the International Conference on Machine Learning (pp. 28-36). Bari, Italy: Morgan Kaufmann.
6. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M.K. (1987). Occam's razor. Information Processing Letters, 24, 377-380.
7. Booker, L., Goldberg, D., & Holland, J. (1989). Classifier systems and genetic algorithms. Artificial Intelligence, 40, 235-282.
8. Brooks, R.A. (1991). Intelligence without representation. Artificial Intelligence, 47, 139-159.
9. Bylander, T. (1994). The computational complexity of prepositional STRIPS planning. Artificial Intelligence, 69, 165-204.
10. Chapman, D. (1989). Penguins can make cake. AI Magazine, 10(4), 45-50.
11. Cohen, W. (1995). PAC-learning recursive logic programs: Efficient algorithms. Journal of Artificial Intelligence Research, 2, 501-539.
12. Cook, S.A. (1971). The complexity of theorem proving procedures. Proceedings of the 3rd Annual ACM Symposium of the Theory of Computing (pp. 151-158). Shaker Heights, Ohio: ACM Press.
13. DeJong, G., & Bennett, S. (1995). Extending classical planning to real world execution with machine learning. Proceedings of the International Joint Conference of Artificial Intelligence (pp. 1153-1159). Montreal, Canada: Morgan Kaufmann.
14. DeJong, G., & Mooney, R. (1986). Explanation based learning: An alternative view. Machine Learning, 1, 145-176.
15. De Raedt, L., & Dzeroski, S. (1994). First order jk-clausal theories are PAC-learnable. Artificial Intelligence, 70, 375-392.
16. Dzeroski, S., Muggleton, S., & Russell, S. (1992). PAC-learnability of determinate logic programs. Proceedings of the Conference on Computational Learning Theory (pp. 128-135). Pittsburgh, PA: ACM Press.
17. Fiechter, C.N. (1994). Efficient reinforcement learning. Proceedings of the Conference on Computational Learning Theory (pp. 88-97). New Brunswick, NJ: ACM Press.
18. Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: W.H. Freeman.
19. Georgeff, M., & Lansky, A. (1987). Reactive reasoning and planning. Proceedings of the National Conference on Artificial Intelligence (pp. 677-682). Philadelphia, PA: AAAI Press.
20. Ginsberg, M. (1989). Universal planning: An (almost) universally bad idea. AI Magazine, 10(4), 40-44.
21. Grefenstette, J., Ramsey, C., & Schultz, A. (1990). Learning sequential decision rules using simulation models and competition. Machine Learning, 5, 355-381.
22. Gupta, N., &Nau, D. (1991). Complexity results for blocks world planning. Proceedings of the National Conference on Artificial Intelligence (pp. 629-633). Anaheim, CA: AAAI Press.
23. Haussler, D. (1989). Learning conjunctive concepts in structural domains. Machine Learning, 4, 7-40.
24. Hayes, P., Ford, K., & Agnew, N. (1994). On babies and bathwather. AI Magazine, 15(4), 15-26.
25. Jonsson, P., & Bäckström, C. (1996). On the size of reactive plans. Proceedings of the National Conference on Artificial Intelligence (pp. 1182-1187). Portland, Oregon: AAAI Press.
26. Kaelbling, L. (1993). Learning in embedded systems. Cambridge, MA: MIT Press.
27. Kaelbling, L., Littman, M., & Moore, A. (1996). Reinforcement learning: A survey. Journal of Artificial Intelligence Research, 4, 237-285.
28. Kambhampati, S. (1995). A comparative analysis of partial order planning and task reduction planning. SIGART Bulletin, 6(1), 16-25.
29. Kearns, M.J., & Schapire, R.E. (1994). Efficient distribution-free learning of probabilistic concepts. Journal of Computer and System Sciences, 48, 464-497.
30. Kearns, M., & Vazirani, U. (1994). An introduction to computational learning theory. Cambridge, MA: MIT Press.
31. Khardon, R. (1997). Learning action strategies for planning domains (Tech. Rep. TR-09-97). Harvard University: Aiken Computation Lab.
32. Khardon, R., & Roth, D. (1995). Learning to reason with a restricted view. Proceedings of the Conference on Computational Learning Theory (pp. 301-310). Santa Cruz, CA: ACM Press.
33. Khardon, R., & Roth, D. (1997). Learning to reason. Journal of the ACM, 44, 697-725.
34. Klahr, D., Langley, P., & Neches, R. (1986). Production system models of learning and development. Cambridge, MA: MIT Press.
35. Korf, R.E. (1985). Macro operators: A weak method for learning. Artificial Intelligence, 26, 35-77.
36. Laird, J., Rosenbloom, P., & Newell, A. (1986). Chunking in Soar: The anatomy of a general learning mechanism. Machine Learning, 1, 11-46.
37. Lin, L. (1993). Scaling up reinforcement learning for robot control. Proceedings of the International Conference on Machine Learning (pp. 182-189). Amherst, MA: Morgan Kaufmann.
38. Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, 285-318.
39. Littman, M., Cassandra, A., & Kaelbling, L. (1995). Learning policies for partially observable environments: Scaling up. Proceedings of the International Conference on Machine Learning (pp. 362-370). Tahoe, CA: Morgan Kaufmann.
40. Maes, P. (1991). Situated agents can have goals. In P. Maes (Ed.), Designing autonomous agents (pp. 49-70). Cambridge, MA: MIT Press.
41. McCarthy, J. (1958). Programs with common sense. Proceedings of the Symposium on the Mechanization of Thought Processes (Vol. 1, pp. 77-84), National Physical Laboratory. Reprinted in R. Brachman and H. Levesque (Eds.), Readings in Knowledge Representation, 1985, Los Altos, CA: Morgan Kaufmann.
42. McCarthy, J. (1958). Programs with common sense. Proceedings of the Symposium on the Mechanization of Thought Processes (Vol. 1, pp. 77-84), National Physical Laboratory. Reprinted in R. Brachman and H. Levesque (Eds.), Readings in Knowledge Representation, 1985, Los Altos, CA: Morgan Kaufmann.
43. Minton, S. (1990). Quantitative results concerning the utility of explanation based learning. Artificial Intelligence, 42, 363-391.
44. Mitchell, T., Keller, R., & Kedar-Cabelli, S. (1986). Explanation based learning: A unifying view. Machine Learning, 1, 47-80.
45. Mooney, R.J., & Califf, M.E. (1995). Induction of first-order decision lists: Results on learning the past tense of English verbs. Journal of Artificial Intelligence Research, 3, 1-24.
46. Muggleton, S. (1994). Inductive logic programming: Derivations, successes and shortcomings. SIGART Bulletin, 5(1), 5-11.
47. Muggleton, S., & De Raedt, L. (1994). Inductive logic programming: Theory and methods. Journal of Logic Programming, 20, 629-679.
48. Natarajan, B.K. (1989). On learning from exercises. Proceedings of the Conference on Computational Learning Theory (pp. 72-87). Santa Cruz, CA: Morgan Kaufmann.
49. Natarajan, B.K., & Tadepalli, P. (1988). Two new frameworks for learning. Proceedings of the International Conference on Machine Learning (pp. 402-415). Ann Arbor, Michigan: Morgan Kaufmann.
50. Newell, A. (1990). Unified theories of cognition. Cambridge, MA: Harvard University Press.
51. Newell, A., & Simon, H.A. (1972). Human problem solving. Englewood Cliffs, NJ: Prentice-Hall.
52. Nilsson, N.J. (1994). Teleo-reactive programs for agent control. Journal of Artificial Intelligence Research, 1, 139-158.
53. Pitt, L., & Valiant, L.G. (1988). Computational limitations on learning from examples. Journal of the ACM, 35, 965-984.
54. Quinlan, J.R. (1990). Learning logical definitions from relations. Machine Learning, 5, 239-266.
55. Rivest, R.L. (1987). Learning decision lists. Machine Learning, 2, 229-246.
56. Rosenbloom, R, & Laird, J. (1986). Mapping explanation based learning onto Soar. Proceedings of the National Conference on Artificial Intelligence (pp. 561-567). Philadelphia, PA: AAAI Press.
57. Rosenbloom, P.S., Laird, J.E., & Newell, A. (1993). The Soar papers : Research on integrated intelligence. Cambridge, MA: MIT Press.
58. Roth, D. (1995). Learning to reason: The non-monotonic case. Proceedings of the International Joint Conference of Artificial Intelligence (pp. 1178-1184). Montreal, Canada: Morgan Kaufmann.
59. Sammut, C., Hurst, S., Kedzier, D., & Michie, D. (1992). Learning to fly. Proceedings of the International Conference on Machine Learning (pp. 385-393). Aberdeen, Scotland: Morgan Kaufmann.
60. Schoppers, M. (1987). Universal plans for reactive robots in unpredictable domains. Proceedings of the International Joint Conference of Artificial Intelligence (pp. 1039-1046). Milan, Italy: Morgan Kaufmann.
61. Schoppers, M. (1989). In defense of reaction plans as caches. AI Magazine, 10(4), 51-62.
62. Selman, B. (1994). Near-optimal plans, tractability, and reactivity. Proceedings of the International Conference on Knowledge Representation and Reasoning (pp. 521-529). Bonn, Germany: Morgan Kaufmann.
63. Shavlik, J.W. (1990). Acquiring recursive and iterative concepts with explanation based learning. Machine Learning, 5, 39-70.
64. Slaney, J., & Thiebaux, S. (1996). Linear time near-optimal planning in the blocks world. Proceedings of the National Conference on Artificial Intelligence (pp. 1208-1214). Portland, Oregon: AAAI Press.
65. Sutton, R.S. (1988). Learning to predict by the methods of temporal differences. Machine Learning, 3, 9-44.
66. Sutton, R.S. (1990). Integrated architectures for learning, planning, and reacting based on approximating dynamic programming. Proceedings of the International Conference on Machine Learning (pp. 216-224). Austin, Texas: Morgan Kaufmann.
67. Tadepalli, P. (1991). A formalization of explanation based macro-operator learning. Proceedings of the International Joint Conference of Artificial Intelligence (pp. 616-622). Sydney, Australia: Morgan Kaufmann.
68. Tadepalli, P. (1992). A theory of unsupervised speedup learning. Proceedings of the National Conference on Artificial Intelligence (pp. 229-234). San Jose, CA: AAAI Press.
69. Tadepalli, P., & Natarajan, B. (1996). A formal framework for speedup learning from problems and solutions. Journal of Artificial Intelligence Research, 4, 445-475.
70. Tesauro, G. (1992). Temporal difference learning of backgammon strategy. Proceedings of the International Conference on Machine Learning (pp. 451-457). Aberdeen, Scotland: Morgan Kaufmann.
71. Tesauro, G. (1995). Temporal difference learning and TD-Gammon. Communications of the ACM, 38, 58-68.
72. Valiant, L.G. (1984). A theory of the learnable. Communications of the ACM, 27, 1134-1142.
73. Valiant, L.G. (1985). Learning disjunctions of conjunctions. Proceedings of the International Joint Conference of Artificial Intelligence (pp. 560-566). Los Angeles, CA: Morgan Kaufmann.
74. Valiant, L.G. (1994). Circuits of the mind. Oxford, UK: Oxford University Press.
75. Valiant, L.G. (1995). Rationality. Proceedings of the Conference on Computational Learning Theory (pp. 3-14). Santa Cruz, CA: ACM Press.
76. Valiant, L.G. (1996). A neuroidal architecture for cognitive computation (Tech. Rep. TR-11-96). Harvard University: Aiken Computation Lab.
77. VanLehn, K. (1987). Learning one subprocedure per lesson. Artificial Intelligence, 31, 1-40.
78. Veloso, M. (1992). Learning by analogical reasoning in general problem solving. Ph.D. thesis, School of Computer Science, Carnegie Mellon University. Also appeared as Technical Report CMU-CS-92-174.
79. Veloso, M., Carbonell, J., Perez, A., Borrajo, D., Fink, E., & Blythe, J. (1995). Integrating learning and planning: The PRODIGY architecture. Journal of Experimental and Theoretical Artificial Intelligence, 7, 81-120.
80. Vera, A., & Simon, H. (1993). Situated action: A symbolic interpretation. Cognitive Science, 17, 7-48.
81. Watkins, C., & Dayan, P. (1992). Q-learning. Machine Learning, 8, 279-292.
82. Weld, D. (1994). An introduction to least commitment planning. AI Magazine, 15(4), 27-61.
83. Zelle, J.M., & Mooney, R.J. (1994). Inducing deterministic Prolog parsers from treebanks: A machine learning approach. Proceedings of the National Conference on Artificial Intelligence (pp. 748-753). Seattle, Washington: AAAI Press.