Unifying SAT-based and graph-based planning

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1999, Pages 318-325

  Kautz, Henry ^a   Selman, Bart ^b  

^a AT AND T LABS RESEARCH   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; PLANNING AS SATISFIABILITY; PLANNING SYSTEMS; PROBLEM INSTANCES; PROPAGATION ALGORITHM; SIMPLIFICATION ALGORITHMS; STRIPS PLANNING; UNIFIED APPROACH;

ARTIFICIAL INTELLIGENCE;

ALGORITHMS;

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

References (29)

1. Bacchus, F. and Kabanza, F. (1996). Using temporal logic to control search in a forward-chaining planner. In New Directions in Planning, M. Ghallab and A. Milani (Eds.), IOS Press, 141-153.
2. Bayardo Jr., R.J. and Schrag, R.C. (1997). Using CSP look-back techniques to solve real world SAT instances. Proc. AAAI-97, Portland, OR.
3. Baioletti, M., Marcugini, S., and Milani, A. (1998). C-SATPlan: a SATPlan-based tool for planning with constraints. AIPS-98 Workshop on Planning as Combinatorial Search, Pittsburgh, PA.
4. van Beek, P. and Chen, X. CPlan: A constraint programming approach to planning. Proc. AAAI-99, Orlando, FL.
5. Blum, A. and Furst, M.L. (1995). Fast planning through planning graph analysis. Proc. IJCAI-95, Montreal, Canada.
6. Chapman, D. (1985). Planning for conjunctive goals. TR AI-TR-802, M.I.T. AI Lab.
7. Cheng, Y., Selman, B., and Kautz, H. (1999). Control knowledge in planning: benefits and tradeoffs. Proc. AAAI-99, Orlando, FL.
8. Ernst, M.D., Millstein, T.D., and Weld, D.S. (1997). Automatic SAT-compilation of planning problems. Proc. IJCAI-97, Nagoya, Japan.
9. Fikcs, R. E., and Nilsson, N. 1971. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. Artificial Intelligence 5(2): 189-208.
10. Fox, M., and Long, D. 1998. The automatic inference of state invariants in TIM. Forthcoming.
11. Gerevini, A. and Schubert, L. 1998. Inferring state constraints for domain-independent planning. Proc AAAI-98, Madison, WI.
12. Gomes, C.P., Selman, B., and Kautz, H. (1998). Boosting combinatorial search through randomization. Proc. AAAI-98, Madison, WI.
13. Giunchiglia, E., Massarotto, A., and Sebastiani, R. (1998). Act, and the rest will follow: exploiting determinism in planning as satisfiability. Proc. AAAI-98, Madison, WI.
14. Kambhampati, S. (1997). Challenges in bridging plan synthesis paradigms. Proc. IJCAI-97, Nagoya, Japan.
15. Kambhampati, S., Lambrecht, E., and Parker, E. (1997). Understanding and extending graphplan. Proc. 4th European Conf. on Planning, S. Steel, ed., vol. 1248 of LNA/, Springer.
16. Kautz, H., McAllester, D. and Selman, B. (1996). Encoding plans in propositional logic. Proc. KR-96, Boston, MA.
17. Koehler, J., Nebel, B., Hoffmann, J., and Dimopoulos, Y. (1997). Extending planning graphs to an ADL subset. Proc. 4th European Conf. on Planning, ibid.
18. Li, Chu Min and Anbulagan (1997). Heuristics based on unit propagation for satisfiability problems. Proc. IJCAI-97, Nagoya, Japan.
19. Luby, M., Sinclair A., and Zuckcrman, D. (1993). Optimal speedup of Las Vegas algorithms. Information Process. Lett., 17,1993,173-180.
20. Kautz, H. and Selman, B. (1992). Planning as satisfiability. Proc. ECAI-92, Vienna, Austria, 359-363.
21. Kautz, H. and Selman, B. (1998). The role of domain-specific axioms in the planning as satisfiability framework. Proc. AIPS-98, Pittsburgh, PA.
22. Kautz, H. and Selman, B. (1996). Pushing the envelope: planning, propositional logic, and stochastic search. Proc. AAA1-I996, Portand, OR.
23. McCarthy, J. and Hayes, P. (1969). Some philosophical problems from the standpoint of artificial intelligence. In Machine Intelligence 4, D. Michie, ed., Ellis Horwood, Chichester, England, page 463ff.
24. McDermott, D., et al. (1998). PDDL - the planning domain definition language. Draft.
25. Nebel, B., Dimopolous, Y., and Koehler, J. (1997). Ignoring irrelevant facts and operators in plan generation. Proc. 4th European Conf. on Planning, ibid.
26. Rintanen, J. (1998). A planning algorithm not based on directional search. Proc. KR-98, A.G. Cohn, L.K. Schubert, and S.C. Shapiro, eds., Morgan Kaufmann.
27. Selman, B., Kautz, H., and Cohen, B. (1994). Noise strategies for local search. Proc. AAAI-94, Seattle, WA.
28. Veloso, M. (1992). Learning by analogical reasoning in general problem solving. Ph.D. Dissertation, CMU.
29. Weld, D. (1999). Recent advances in AI planning. AI Magazine, to appear.