Using temporal logics to express search control knowledge for planning

Artificial Intelligence

Volumn 116, Issue 1-2, 2000, Pages 123-191

  Bacchus, Fahiem ^a   Kabanza, Froduald ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITÉ DE SHERBROOKE   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; PLANNING;

SEARCH CONTROL KNOWLEDGE; TEMPORAL LOGIC;

KNOWLEDGE REPRESENTATION;

EID: 0033897011     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00071-5     Document Type: Article

References (62)

1. AIPS98, Artificial Intelligence Planning Systems 1998 planning competition. http://ftp.cs.yale.edu/pub/mcdermott/aipscomp-results.html, 1998.
2. Bacchus F., Kabanza F. Planning for temporally extended goals. Proc. AAAI-96, Portland, OR. 1996;1215-1222.
3. Bacchus F., Kabanza F. Using temporal logic to control search in a forward chaining planner. Ghallab M., Milani A. New Directions in AI Planning. 1996;141-153 IOS Press, Amsterdam.
4. Bacchus F., Kabanza F. Planning for temporally extended goals. Ann. Math. Artificial Intelligence. 22:1998;5-27.
5. Bacchus F., Petrick R. Modeling and agent's incomplete knowledge during planning and execution. Proc. International Conference on Principles of Knowledge Representation and Reasoning (KR-98), Trento, Italy. 1998;432-443.
6. Barbeau M., Kabanza F., St-Denis R. Synthesizing plant controllers using real-time goals. Proc. IJCAI-95, Montreal, Quebec. 1995;791-798.
7. Barrett A., Golden K., Penberthy J.S., Weld D. UCPOP user's manual (version 2.0). Technical Report TR-93-09-06:1993;University of Washington, Department of Computer Science and Engineering. (ftp://cs.washington.edu/pub/ai/).
8. Barrett A., Weld D. Task-decomposition via plan parsing. Proc. AAAI-94, Seattle, WA. 1994;1117-1122.
9. Barrett A., Weld D.S. Partial-order planning: Evaluating possible efficiency gains. Artificial Intelligence. 67:(1):1994;71-112.
10. Bauer M., Biundo S., Dengler D., Hecking M., Koehler J., Merziger G. Integrated plan generation and recognition - A logic-based approach. Technical Report RR-91-26:1991;DFKI.
11. Biundo S., Stephan W. Modeling planning domains systematically. Proc. European Conference on Artificial Intelligence (ECAI-96). 1996;599-603 Wiley, New York.
12. Biundo S., Stephan W. System assistance in structured domain model development. Proc. IJCAI-97, Nagoya, Japan. 1997;1240-1245 Morgan Kaufmann, San Mateo, CA.
13. Blum A., Furst M. Fast planning through planning graph analysis. Artificial Intelligence. 90:1997;281-300.
14. Bonet B., Loerincs G., Geffner H. A robust and fast action selection mechanism for planning. Proc. AAAI-97, Providence, RI. 1997;714-719.
15. Boutilier C., Dearden R. Using abstractions for decision-theoretic planning with time constraints. Proc. AAAI-94, Seattle, WA. 1994;1016-1022.
16. Carbonell J.G., Blythe J., Etzioni O., Gil Y., Joseph R., Khan D., Knoblock C., Minton S., Pérez A., Reilly S., Veloso M., Wang X. Prodigy 4.0: The manual and turorial. Technical Report CMU-CS-92-150:1992;School of Computer Science, Carnegie Mellon University, Pittsburgh, PA.
17. Currie K., Tate A. O-plan: The open planning architecture. Artificial Intelligence. 52:1991;49-86.
18. Dean T., Kaelbling L.P., Kerman J., Nicholson A. Planning with deadlines in stochastic domains. Proc. AAAI-93, Washington, DC. 1993;574-579.
19. Emerson E.A. Temporal and modal logic. Leeuwen J. van. Handbook of Theoretical Computer Science, Vol. B. 1990;997-1072 Elsevier Science, Amsterdam/MIT Press, Cambridge, MA.
20. Erol K., Nau D.S., Subrahmanian V.S. On the complexity of domain-independent planning. Proc. AAAI-92, San Jose, CA. 1992;381-386.
21. Erol K. Hierarchical task network planning: Formalization, analysis, and implementation, Ph.D. Thesis. 1995;University of Maryland, College Park, MD.
22. Etzioni O. Acquiring search-control knowledge via static analysis. Artificial Intelligence. 62:(2):1993;255-302.
23. Garson J.W. Quantification in modal logic. Gabbay D., Guenthner F. Handbook of Philosophical Logic, Vol. II. 1977;249-307 Reidel, Dordrecht.
24. Gerevini A., Schubert L. Accelerating partial-order planners: Some techniques for effective search control and pruning. J. Artificial Intelligence Res. 5:1996;95-137.
25. Green C. Application of theorem proving to problem solving. Proc. IJCAI-69, Washington, DC. 1969;219-239.
26. Gupta N., Nau D.S. On the complexity of blocks-world planning. Artificial Intelligence. 56:1992;223-254.
27. Halpern J.Y., Vardi M.Y. Model checking vs. theorem proving: A manifesto. Allen J.A., Fikes R., Sandewall E. Proc. International Conference on Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA. 1991;325-334 Morgan Kaufmann, San Mateo, CA.
28. Hennessy M. The Semantics of Programming Languages: An Elementary Introduction Using Structural Operational Semantics. 1990;Wiley, New York.
29. Johnson D.S. A catalog of complexity classes. Leeuwen J. van. Handbook of Theoretical Computer Science, Vol. A. 1990;69-161 Elsevier Science, Amsterdam/MIT Press, Cambridge, MA.
30. Joslin D., Pollack M. Least-cost flaw repair: A plan refinement strategy for partial-order planning. Proc. AAAI-94, Seattle, WA. 1994;1004-1009 Morgan Kaufmann, San Mateo, CA.
31. Kanellakis P.C. Elements of relational database theory. Leeuwen J. van. Handbook of Theoretical Computer Science, Vol. B. 1990;1071-1156 Elsevier Science, Amsterdam.
32. Kautz H., Selman B. Pushing the envelope: Planning, propositional logic, and stochastic search. Proc. AAAI-96, Portland, OR. 1996;1194-1201.
33. Kautz H., Selman B. Blackbox: A new approach to the application of theorem proving to problem solving. 1998;. System available at http://www.research.att.com/~kautz.
34. Kautz H., Selman B. The role of domain-specific knowledge in the planning as satisfiability framework. Proc. International Conference on Artificial Intelligence Planning. 1998;181-189.
35. Kibler D., Morris P. Don't be stupid. Proc. IJCAI-81, Vancouver, BC. 1981;345-347.
36. Knoblock C. Automatically generating abstractions for planning. Artificial Intelligence. 68:(2):1994;243-302.
37. Koehler J., Nebel B., Hoffmann J., Dimopoulos Y. Extending planning graphs to an ADL subset. European Conference on Planning. 1997;273-285. System available at http://www.informatik.uni-freiburg.de/ koehler/ipp.html.
38. Laird J., Newell A., Rosenbloom P. SOAR: An architecture for general intelligence. Artificial Intelligence. 33:(1):1987;1-67.
39. Manna Z., Pnueli A. The Temporal Logic of Reactive and Concurrent Systems: Specication. 1992;Springer, New York.
40. McDermott D. A heuristic estimator for means-end analysis in planning. Proc. Third International Conference on AI Planning Systems. 1996.
41. Minton S., Bresina J., Drummond M. Total-order and partial-order planning: A comparative analysis. J. Artificial Intelligence Res. 2:1994;227-262.
42. Minton S. Learning Search Control Knowledge. 1988;Kluwer Academic, Dordrecht.
43. Parekh S. A study of procedural search control in simon. 1996;. http://www.cs.washington.edu/homes/sparekh/quals.ps.
44. Pednault E. ADL: Exploring the middle ground between STRIPS and the situation calculus. Proc. International Conference on Principles of Knowledge Representation and Reasoning (KR-89), Toronto, Ont. 1989;324-332.
45. Poet M., Smith D.E. Threat-removal strategies for partial-order planning. Proc. AAAI-93, Washington, DC. 1993;492-499.
46. Rosenschein S.J. Plan synthesis: A logical perspective. Proc. IJCAI-81, Vancouver, BC. 1981;115-119.
47. Russell S., Norvig P. Artificial Intelligence A Modern Approach. 1995;Prentice Hall, Englewood Cliffs, NJ.
48. Sacerdoti E. Planning in a hierarchy of abstraction spaces. Artificial Intelligence. 5:1974;115-135.
49. Selman B. Near-optimal plans, tractability and reactivity. Proc. International Conference on Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany. 1994;521-529.
50. Sistla A.P. Safety, liveness, and fairness in temporal logic. Formal Aspects of Computing. 6:1994;495-511.
51. Sistla A.P., Clarke E.M. The complexity of propositional linear temporal logic. J. ACM. 32:1985;733-749.
52. Srivastava B., Kambhampati S. Synthesizing customized planners from specifications. J. Artificial Intelligence Res. 8:1998;93-128.
53. Stephan W., Biundo S. Deduction-based refinement planning. Proc. International Conference on Artificial Intelligence Planning. 1996;213-220 AAAI Press, Menlo Park, CA.
54. Tash J., Russell S. Control strategies for a stochastic planner. Proc. AAAI-94, Seattle, WA. 1994;1079-1085.
55. Tate A. Generating project networks. Proc. IJCAI-77, Cambridge, MA. 1977;888-893.
56. Thompson C. Carpoolworld. Undergraduate project in CS486:1998;University of Waterloo, Ont.
57. Vardi M.Y. The complexity of relational query langauges. Proc. 14th Ann. ACM Symp. on Theory of Computing. 1982;176-185.
58. Vardi M.Y. Computational model theory: An overview. Logic J. IGPL. 6:(4):1998;601-623.
59. Veloso M., Carbonell J., Pérez A., Borrajo D., Fink E., Blythe J. Integrating planning and learning: The PRODIGY architecture. J. Experimental and Theoretical Artificial Intelligence. 7:(1):1995.
60. Weld D., Etzioni O. The first law of robotics (a call to arms). Proc. AAAI-94, Seattle, WA. 1994;1042-1047.
61. Weld D.S. An introduction to least commitment planning. AI Magazine. 15:(4):1994;27-61.
62. Wilkins D. Practical Planning: Extending the Classical AI Planning Paradigm. 1988;Morgan Kaufmann, San Mateo, CA.