Model minimization, regression, and propositional STRIPS planning

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2, Issue , 1997, Pages 1163-1168

  Givan, Robert ^a   Dean, Thomas ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER-AIDED VERIFICATIONS; EXACT COMPUTATIONS; FLUENTS; MINIMIZATION ALGORITHMS; MINIMIZATION TECHNIQUES; NP COMPLETE; REACHABILITY ANALYSIS; STRIPS PLANNING;

ARTIFICIAL INTELLIGENCE; COMPUTER AIDED ANALYSIS; MODEL CHECKING; REGRESSION ANALYSIS;

AUTOMATA THEORY;

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

References (15)

1. Backstrom, C. and Klein, I. 1991. Parallel non-binary planning in polynomial time. In Proceedings fJCAI 12. IJCAII. 268-273.
2. Bouajjani, A.; Fernandez, J.-C; Halbwachs, N.; Raymond, P.; and Ratel, C. 1992. Minimal state graph generation. Science of Computer Programming 18:247-269.
3. Boutilier, Craig; Dearden, Richard; and Goldszmidt, Moises 1995. Exploiting structure in policy construction. In Proceedings IJCAJ 14- IJCAII. 1104-1111.
4. Burch, Jerry; Clarke, Edmund M.; Long, David; McMillan, Kenneth L.; and Dill, David L. 1994. Symbolic model checking for sequential circuit verification. IEEE Transactions on Computer Aided Design 13(4):401-424.
5. Bylander, Tom 1994. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69:165-204.
6. Dean, Thomas and Givan, Robert 1997. Model minimization in Markov decision processes. In Proceedings AAAl-91. AAAI.
7. Dean, Thomas; Givan, Robert; and Leach, Sonia 1997. Model reduction techniques for computing approximately optimal solutions for Markov decision processes. In Thirteenth Conference on Uncertainty in Artificial Intelligence.
8. Dietterich, Thomas G. and Flann, Nicholas S. 1995. Explanation-based learning and reinforcement learning: A unified view. In Proceedings Twelfth International Conference on Machine Learning. 176-184.
9. Etzioni, Oren 1993. Acquiring search-control knowledge via static analysis. Artificial Intelligence 62:255-302.
10. Fikes, Richard and Nilsson, Nils J. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2:189-208.
11. Gupta, Naresh and Nau, Dana S. 1991. Complexity results for blocks-world planning. In Proceedings AAAI-91. AAAI. 629-633.
12. Hopcroft, J. E. 1971. An n log n algorithm for minimizing states in a finite automaton. In Kohavi, Z. and Paz, A., editors 1971, Theory of Machines and Computations. Academic Press, New York, San Francisco, California. 189-196.
13. Lee, David and Yannakakis, Mihalis 1992. Online minimization of transition systems. In Proceedings of 24th Annual ACM Symposium on the Theory of Computing.
14. Paige, R. R. and Tarjan 1987. Three partition refinement algorithms. SIAM J. on Computing 16:973-989.
15. Selman, Bart; Levesque, Hector; and Mitchell, David 1992. A new method for solving hard satisfiability problems. In Proceedings AAAI-92. AAAI. 440-446.