Fusing procedural and declarative planning goals for nondeterministic domains

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2008, Pages 983-990

  Shaparau, Dzmitry ^a   Pistore, Marco ^a   Traverso, Paolo ^a  

^a ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIONICS; INFORMATION THEORY; LINGUISTICS; TEMPORAL LOGIC;

DECLARATIVE GOALS; DO-MAINS; EXPERIMENTAL EVALUATIONS; FORMAL DEFINITIONS; KEY FEATURES; PLANNING FRAMEWORKS; PLANNING GOALS; PROCEDURAL PLANS;

THEOREM PROVING;

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

References (21)

1. Bacchus, F., and Kabanza, F. 2000. Using temporal logic to express search control knowledge for planning. Artificial Intelligence 16(1-2): 123-191.
2. Baier, J. A.; Fritz, C.; and McIlraith, S. A. 2007. Exploiting procedural domain control knowledge in state-of-the-art planners. In ICAPS.
3. Bertoli, P.; Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. 2001. MBP: a Model Based Planner. In IJCAI01.
4. Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. 2003. Weak, Strong, and Strong Cyclic Planning via Symbolic Model Checking. Artificial Intelligence 147(1-2):35-84.
5. Claßen, J.; Eyerich, P.; Lakemeyer, G.; and Nebel, B. 2007. Towards an integration of golog and planning. In IJCAI, 1846-1851.
6. Dal Lago, U.; Pistore, M.; and Traverso, P. 2002. Planning with a language for extended goals. In AAAI, 447-454.
7. Edmonton, Alberta, Canada: AAAI-Press/The MIT Press.
8. Emerson, E. A. 1990. Temporal and modal logic. In van Leeuwen, J., ed., Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics. Elsevier. chapter 16, 995-1072.
9. Hoffmann, J., and Brafman, R. 2005. Contingent planning via heuristic forward search with implicit belief states. In ICAPS, 71-80.
10. Kabanza, F., and Thiébaux, S. 2005. Search control in planning for temporally extended goals. In ICAPS, 130-139.
11. Kabanza, F.; Barbeau, M.; and St-Denis, R. 1997. Planning control rules for reactive agents. Artificial Intelligence 95(1):67-113.
12. Kuter, U., and Nau, D. S. 2004. Forward-chaining planning in nondeterministic domains. In AAAI, 513-518.
13. Kuter, U.; Nau, D. S.; Pistore, M.; and Traverso, P. 2005. A hierarchical task-network planner based on symbolic model checking. In ICAPS, 300-309.
14. Levesque, H. J.; Reiter, R.; Lesperance, Y.; Lin, F.; and Scherl, R. B. 1997. GOLOG: A logic programming language for dynamic domains. Journal of Logic Programming 31(1-3):59-83.
15. McIlraith, S., and Fadel, R. 2002. Planning with complex actions. In NMR.
16. Pistore, M., and Traverso, P. 2001. Planning as model checking for extended goals in non-deterministic domains. In Nebel, B., ed., IJCAI-01, 479-486. Morgan Kaufmann Publisher.
17. Pistore, M.; Bettin, R.; and Traverso, P. 2001. Symbolic techniques for planning with extended goals in non-deterministic domains. In ECP'01, LNAI. Springer Verlag.
18. Pistore, M.; Marconi, A.; Traverso, P.; and Bertoli, P. 2005. Automated Composition of Web Services by Planning at the Knowledge Level. In IJCAI'05.
19. Pistore, M.; Traverso, P.; and Bertoli, P. 2005. Automated Composition of Web Services by Planning in Asynchronous Domains. In ICAPS'05.
20. Rintanen, J. 1999. Constructing conditional plans by a theorem-prover. Journal of Artificial Intellegence Research 10:323-352.
21. Williams, B. C.; Ingham, M. D.; Chung, S.; Elliott, P.; Hofbaur, M.; and Sullivan, G. T. 2004. Model-based programming of fault-aware systems. AI Mag. 24(4):61-75.