The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework

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

Volumn , Issue , 1998, Pages 181-189

  Kautz, Henry ^a   Selman, Bart ^b  

^a AT AND T LABS RESEARCH   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN KNOWLEDGE;

DOMAIN KNOWLEDGE; DOMAIN-INDEPENDENT PLANNING; DOMAIN-SPECIFIC KNOWLEDGE; LOCAL SEARCH; PERFORMANCE; PLANNING AS SATISFIABILITY; PLANNING SYSTEMS; POWER; SOLUTION TIME;

SEARCH ENGINES;

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

References (36)

1. Adorf, H.M.Johnston, M.D.(1990). A discrete stochastic neural networkalgorithm for constraint satisfaction problems. Proc. of the Int. Joint Conf. on Neural Network, San Diego, CA,1990.
2. Agre, P. and Chapman,D. (1987). Pengi: an implementation of a theory of activity. Proc. AAAI-87,Seattle, WA.
3. Bacchus, F. and Kabanza, F. (1995). Using temporal logic to control search in a forward-chainingplanner. Technica report, University of Waterloo.
4. Blum, A. and Furst, M.L. (1995). Fast planning through planning graph analysis. Proc. IJCAI-g5, Montreal, Canada.
5. Bonet, B., Loerincs, G., and Geffner, H. (1990). A robust and fast action selection mechanism. Proc. AAAI-97, Providence, RI, 714-719.
6. Carbonell, J., Blythe J., Etzioni, O., Gil, Y., Joseph, P., Kahn,D., Knoblock, C., Minton,S., Perez, A., PLeilly, S., Veloso, M., Wang, X (1992). Prodigy 4.0: the manual and tutorial. CMU,CS Tech. Report CMUoCS-92-150.
7. Crawford, J.M. and Auton, L.D. (1993). Experimental re-suits on the cross-over point in satisfiability problems. Proc. AAAI-93, Washington, DC, 21-27.
8. Ernst, M.D., Millstein, T.D., and Weld, D.S. (1997). Automatic SAT-compilation of planning problems. Proc. IJCAI-gT, Nagoya, Japan, 1169-1176.
9. Erol, K., Nan, D.S., and Subrahmanian, V.S. (1992). the complexity of domain-independentplanning. Proceedings AAAI, 381-386.
10. Etzioni, Oren (1993). Acquiring search-control knowledge via static analysis. Artificial Intelligence, 62(2), 255-302.
11. Frank, J., Cheeseman, P., and Stutz, J. (to appear). When gravity fails: local search topology.
12. Gupta and Nau(1992). Onthe complexity of blocks-world planning.Artificial Intelligence, 56, 139-403.
13. Joslin, D. and Pollack, M.(1995). Passive and Active Decision Postponementin Plan Generation. In the European Workshopon Planning(EWSP),Assisi, Italy, Sept. 1995.
14. Joslin D. and Roy, A. (1997). Exploiting symmetries lifted CSPs. Proc. AAAI-97,Providence, RI.
15. Kambhampati, S., Katuicam, S., and Qu, Y. (1996). Failure driven dynamicsearch control for partial order planners: an explanation based approach. Artificial Intelligence88(1-2), 253-315.
16. Kantz, H., McAllester, D., and Selman, B. (1996). Encoding plans in propositional logic. Proc. KR-96, Cambridge, MA.
17. Kautz,H. and Seiman, B. (1996). Pushing the envelope: planning,propositionallogic, andstochastic search. Prec. AAAI-Igg6, Portand, OR,1996.
18. Knoblock, C. (1994). Automatically generating abstractions for planning.Artificial Intelligence 68(2).
19. Li, Chu Min and Anbulagan (1997). Heuristics based on unit propagation for satlsfiability problems. Proc. IJCAI-gT, Kyoto, Japan, 1997.
20. McAllester, David (1991). Observations on cognitive judgements. Proc. AAAI-gl, Anaheim,CA,910-915.
21. Minton,S. (1988). Quantitative results concerningthe utility of explanation-based learning. Proc. AAAI-88, St. Paul, MN,564-569.
22. Muscettola, N. (1994). Onthe utility of bottleneck reasoning for scheduling. Proc. AAAI-94, Seattle, WA,1105-1110.
23. Penberthy, J. and Weld, D. (1992). UCPOP:A sound, complete, partial order planner for ADL.In the Proc. of the Third Int. Conf. on KnomledgeRepresentation and Reasoning, Boston, MA,103-114.
24. Sacerdoti, E. D. (1977). AStructure for Plans and Behavior. Elsevier, NY.
25. Selman, B. and Kautz, H. (1996). Knowledgecompilation and theory approximation. Journal of the A CM, 43(2):193-224,1996.
26. Seiman,B.,Kautz, Search. H., and Proc. Cohen,B. AAAI-94, (1994). Seattle, Noise WA, Strate- 1994
27. Selman,B., Levesque, H.J., and Mitchell, D. (1992) A new methodfor solving hard satisfiability problems. Proc. AAAI-9, San Jose, CA(1992) 440-446.
28. Slaney, J. and Thiebaux, S. (1996). Linear time near-optimal planning in the blocks world. Proc. AAAI-96, Portland, OR,1996.
29. Smith, D. (1989). Controlling backwardinference. Artificial Intelligence, 39, 145-208.
30. Smith, D. and Parra, E. Transfornational Approach to Transportation Scheduling, Proc. of the 8th KnowledgeBasedSoftware Eng. Conf., 1993, Chicago, IL.
31. Smith, D. and Peot, M. (1996). Suspending recurison causal link planning. Proc. AIPS-g6, Edinburgh, UK, 1996.
32. Stone, P., Veloso, M., and Blythe, J. (1994). Theneed for different domain-independent heuristics. In AIPSgJ, pages 164-169, Chicago, 1994.
33. Veloso, M.(1992). Learningby analogical reasoningin general problem solving. Ph.D. Thesis, CMU,CS Techn. Report CMU-CS-92-174.
34. Vere, S. (1985). Temporalscope of assertions and window cutoff. Proc. IJCAI-85, Los Angeles, CA.
35. Williams, B. and Nayak, P. (1997). A reactive planner for a model-basedexecutive. Proc. IJCAI-g7, Kyoto, Japan.
36. Weld, D. (1994). An introduction to least commitment planning. AI Magazine, Summer/Fail1994.