How to Solve It Automatically: Selection Among Problem-Solving Methods

Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems, AIPS 1998

Volumn , Issue , 1998, Pages

  Fink, Eugene ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBLEM SOLVING;

AUTOMATIC SELECTION; PERFORMANCE; PLANNING SYSTEMS; PROBLEM SOLVING METHODS; SELECTION ALGORITHM; STATISTICAL PROBLEMS;

SEARCH ENGINES;

EID: 85166375551     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Bacchus, F., and Yang, Q. 1992. The expected value of hierarchical problem-solving. In Proceedings of the Tenth . National Conference on Artificial Intelligence.
2. Breese, J. S., and Horvitz, E. J. 1990. Ideal reformulation of belief networks. In Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence, 64–72.
3. Fink, E. 1997. Statistical selection among problem-solving methods. Technical Report CMU-CS-97-101, Department of Computer Science, Carnegie Mellon University.
4. Hansen, E. A., and Zilberstein, S. 1996. Monitoring the progress of anytime problem-solving. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, 1229–1234.
5. Hansson, O., and Mayer, A. 1989. Heuristic search and evidential reasoning. In Proceedings of the Fifth Workshop on Uncertainty in Artificial Intelligence, 152–161.
6. Horvitz, E. J. 1988. Reasoning under varying and uncertain resource constraints. In Proceedings of the Seventh National Conference on Artificial Intelligence, 111–116.
7. Knoblock, C. A. 1991. Automatically Generating Abstractions for Problem Solving. Ph.D. Dissertation, School of Computer Science, Carnegie Mellon University. Technical Report CMU-CS-91-120.
8. Knoblock, C. A. 1994. Automatically generating abstractions for planning. Artificial Intelligence 68:243–302.
9. Minton, S. 1996. Automatically configuring constraint satisfaction programs: A case study. Constraints: An InternationalJournal1:7–43.
10. Mouaddib, A., and Zilberstein, S. 1995. Knowledge-based anytime computation. In Proceedings of the International Joint Conference on Artificial Intelligence, 775–781.
11. Newell, A., and Simon, H. A. 1972. Human Problem Solving. Englewood Cliffs, NJ: Prentice Hall.
12. Pérez, M. A. 1995. Learning Search Control Knowledge to Improve Plan Quality. Ph.D. Dissertation, School of Computer Science, Carnegie Mellon University. Technical Report CMU-CS-95-175.
13. Polya, G. 1957. How to Solve It. Garden City, NY: Doubleday, second edition.
14. Russell, S. J.; Subramanian, D.; and Parr, R. 1993. Provably bounded optimal agents. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, 338–344.
15. Russell, S. J. 1990. Fine-grained decision-theoretic search control. In Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence, 436–442.
16. Stone, P.; Veloso, M. M.; and Blythe, J. 1994. The need for different domain-independent heuristics. In Proceedings of the Second International Conference on AI Planning Systems, 164–169.
17. Valiant, L. G. 1984. A theory of the learnable. Communications of the ACM 27:1134–1142.
18. Veloso, M. M., and Stone, P. 1995. FLECS: Planning with a flexible commitment strategy. Journal of Artificial Intelligence Research 3:25–52.
19. Veloso, M. M. 1994. Planning and Learning by Analogical Reasoning. Springer Verlag.