[AKN05] Tsz-Chiu Au, Ugur Kuter, and Dana S. Nau. Web service composition with volatile information. In Gil et al. [GMBM05], pages 52-66. [ bib | .pdf ]
[Bar88] H. P. Barendregt. Introduction to lambda calculus. In Aspenæs Workshop on Implementation of Functional Languages, Göteborg. Programming Methodology Group, University of Göteborg and Chalmers University of Technology, 1988. [ bib | .html ]
[BBF+05] Mathias Bauer, Boris Brandherm, Johannes Fürnkranz, Gunter Grieser, Andreas Hotho, Andreas Jedlitschka, and Alexander Kröner, editors. Lernen, Wissensentdeckung und Adaptivität (LWA) 2005, GI Workshops, Saarbrücken, October 10th-12th, 2005. DFKI, 2005. [ bib ]
[BF97] Avrim Blum and Merrick L. Furst. Fast planning through planning graph analysis. Artif. Intell., 90(1-2):281-300, 1997. [ bib | .pdf ]
[BF00] Susanne Biundo and Maria Fox, editors. Recent Advances in AI Planning, 5th European Conference on Planning, ECP'99, Durham, UK, September 8-10, 1999, Proceedings, volume 1809 of Lecture Notes in Computer Science. Springer, 2000. [ bib ]
[BG99] Blai Bonet and Hector Geffner. Planning as heuristic search: New results. In Biundo and Fox [BF00], pages 360-372. [ bib | .ps ]
[BG01] Blai Bonet and Hector Geffner. Planning and control in artificial intelligence: A unifying perspective. Appl. Intell., 14(3):237-252, 2001. [ bib | .ps ]
[BHH03] Thorsten Belker, Martin Hammel, and Joachim Hertzberg. Learning to optimize mobile robot navigation based on HTN plans. In IEEE [IEE03], pages 4136-4141. [ bib | .html ]
[BK00] Fahiem Bacchus and Froduald Kabanza. Using temporal logics to express search control knowledge for planning. Artif. Intell., 116(1-2):123-191, 2000. [ bib | .pdf ]
[BK04] A. Bouguerra and L. Karlsson. Hierarchical task planning under uncertainty, 2004. [ bib | .html ]
[BMR05] Susanne Biundo, Karen L. Myers, and Kanna Rajan, editors. Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), June 5-10 2005, Monterey, California, USA. AAAI, 2005. [ bib ]
[Bry92] Randal E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv., 24(3):293-318, 1992. [ bib | .ps ]
[Chr06] Jan Christiansen. A purely functional implementation of ROBDDs in Haskell. PhD thesis, Christian-Albrechts-Universität zu Kiel, 2006. [ bib | .pdf ]
[CPRT03] Alessandro Cimatti, Marco Pistore, Marco Roveri, and Paolo Traverso. Weak, strong, and strong cyclic planning via symbolic model checking. Artif. Intell., 147(1-2):35-84, 2003. [ bib | .ps.gz ]
[CT91] Ken Currie and Austin Tate. O-plan: The open planning architecture. Artif. Intell., 52(1):49-86, 1991. [ bib | .pdf ]
[Dea99] Thomas Dean, editor. Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, Stockholm, Sweden, July 31 - August 6, 1999. 2 Volumes, 1450 pages. Morgan Kaufmann, 1999. [ bib ]
[DGKK98] Patrick Doherty, Joakim Gustafsson, Lars Karlsson, and Jonas Kvarnström. TAL: Temporal Action Logics language specification and tutorial. Electron. Trans. Artif. Intell., 2:273-306, 1998. [ bib | .html ]
[DK99] Patrick Doherty and Jonas Kvarnström. TALplanner: An empirical investigation of a temporal logic-based forward chaining planner. In TIME, pages 47-54, 1999. [ bib | .html ]
[dLP06] Sílvio do Lago Pereira. Planejamento não-determinístico baseado em verificação de modelos. Qualificação de Doutorado, 2006. [ bib | http ]
[EC82] E. Allen Emerson and Edmund M. Clarke. Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comput. Program., 2(3):241-266, 1982. [ bib | http ]
[EHN94a] Kutluhan Erol, James Hendler, and Dana S. Nau. HTN planning: Complexity and expressivity. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), volume 2, pages 1123-1128, Seattle, Washington, USA, 1994. AAAI Press/MIT Press. [ bib | .html ]
[EHN94b] Kutluhan Erol, James Hendler, and Dana S. Nau. Semantics for HTN planning. Technical Report CS-TR-3239, University of Maryland, March 1994. [ bib | .html ]
[EHN94c] Kutluhan Erol, James A. Hendler, and Dana S. Nau. UMCP: A sound and complete procedure for hierarchical task-network planning. In AIPS, pages 249-254, 1994. [ bib | .ps ]
[EHN96] Kutluhan Erol, James A. Hendler, and Dana S. Nau. Complexity results for HTN planning. Ann. Math. Artif. Intell., 18(1):69-93, 1996. [ bib | .ps ]
[EHNT95] Kutluhan Erol, James A. Hendler, Dana S. Nau, and Reiko Tsuneto. A critical look at critics in HTN planning. In IJCAI, pages 1592-1598, 1995. [ bib | .ps ]
[ENS95] Kutluhan Erol, Dana S. Nau, and V. S. Subrahmanian. Complexity, decidability and undecidability results for domain-independent planning. Artif. Intell., 76(1-2):75-88, 1995. [ bib | .pdf ]
[Erw04] Martin Erwig. Escape from zurg: an exercise in logic programming. J. Funct. Program., 14(3):253-261, 2004. [ bib | .pdf ]
[FN71] Richard Fikes and Nils J. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artif. Intell., 2(3/4):189-208, 1971. [ bib | .pdf ]
[FSM03] Dieter Fensel, Katia P. Sycara, and John Mylopoulos, editors. The Semantic Web - ISWC 2003, Second International Semantic Web Conference, Sanibel Island, FL, USA, October 20-23, 2003, Proceedings, volume 2870 of Lecture Notes in Computer Science. Springer, 2003. [ bib ]
[Gam] Peter Gammie. A Haskell binding to Long's BDD library. [ bib | http ]
[GMBM05] Yolanda Gil, Enrico Motta, V. Richard Benjamins, and Mark A. Musen, editors. The Semantic Web - ISWC 2005, 4th International Semantic Web Conference, ISWC 2005, Galway, Ireland, November 6-10, 2005, Proceedings, volume 3729 of Lecture Notes in Computer Science. Springer, 2005. [ bib ]
[GNT04] Malik Ghallab, Dana Nau, and Paolo Traverso. Automated Planning: Theory and Practice. Morgan Kaufman, San Francisco, CA, May 2004. [ bib | http ]
[HHJW07] Paul Hudak, John Hughes, Simon Peyton Jones, and Philip Wadler. A history of Haskell: Being lazy with class. Third ACM SIGPLAN History of Programming Languages Conference (HOPL-III), April 2007. [ bib | .pdf ]
[HN01] Jörg Hoffmann and Bernhard Nebel. The FF planning system: Fast plan generation through heuristic search. J. Artif. Intell. Res. (JAIR), 14:253-302, 2001. [ bib | .ps.gz ]
[How60] R. Howard. Dynamic Programming and Markov Processes. MIT Press, 1960. [ bib ]
[Hug89] J. Hughes. Why Functional Programming Matters. Computer Journal, 32(2):98-107, 1989. [ bib | .html ]
[IEE77] IEEE, editor. 18th Annual Symposium on Foundations of Computer Science, 31 October-2 November, Providence, Rhode Island, USA, 1977. [ bib ]
[IEE03] IEEE, editor. Proceedings of the 2003 IEEE International Conference on Robotics and Automation, ICRA 2003, September 14-19, 2003, Taipei, Taiwan, 2003. [ bib ]
[JEK+90] J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic Model Checking: 1020 States and Beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 1-33, Washington, D.C., 1990. IEEE Computer Society Press. [ bib | .html ]
[Jon92] Neil D. Jones. Partial evaluation and the generation of program generators. Accepted to appear in Communications of The ACM, 1993, 1992. [ bib | .html ]
[KMS98] Subbarao Kambhampati, Amol Dattatraya Mali, and Biplav Srivastava. Hybrid planning for partially hierarchical domains. In AAAI/IAAI, pages 882-888, 1998. [ bib | .pdf ]
[KN04] Ugur Kuter and Dana S. Nau. Forward-chaining planning in nondeterministic domains. In McGuinness and Ferguson [MF04], pages 513-518. [ bib | .pdf ]
[Kni21] Frank H. Knight. Risk, Uncertainty and Profit. Hart, Schaffner, and Marx, 1921. [ bib | http ]
[KNPT05] Ugur Kuter, Dana S. Nau, Marco Pistore, and Paolo Traverso. A hierarchical task-network planner based on symbolic model checking. In Biundo et al. [BMR05], pages 300-309. [ bib | .pdf ]
[KS92] Henry A. Kautz and Bart Selman. Planning as satisfiability. In ECAI, pages 359-363, 1992. [ bib | .ps ]
[KS95] Sven Koenig and Reid G. Simmons. Real-time search in non-deterministic domains. In IJCAI, pages 1660-1669, 1995. [ bib | .pdf ]
[KS99] Henry A. Kautz and Bart Selman. Unifying SAT-based and graph-based planning. In Dean [Dea99], pages 318-325. [ bib | .ps ]
[Kut06] Ugur Kuter. Planning under Uncertainty: Moving Forward. PhD thesis, University of Maryland, College Park, 2006. [ bib | .pdf ]
[Lei] Daan Leijen. Parsec, a fast combinator parser. [ bib | .html ]
[MF04] Deborah L. McGuinness and George Ferguson, editors. Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence, July 25-29, 2004, San Jose, California, USA. AAAI Press / The MIT Press, 2004. [ bib ]
[MK98] Amol Dattatraya Mali and Subbarao Kambhampati. Encoding HTN planning in propositional logic. In Artificial Intelligence Planning Systems, pages 190-198, 1998. [ bib | .html ]
[NAI+03] Dana S. Nau, Tsz-Chiu Au, Okhtay Ilghami, Ugur Kuter, J. William Murdock, Dan Wu, and Fusun Yaman. SHOP2: An HTN planning system. J. Artif. Intell. Res. (JAIR), 20:379-404, 2003. [ bib | .pdf ]
[NAI+05] Dana S. Nau, Tsz-Chiu Au, Okhtay Ilghami, Ugur Kuter, Héctor Muñoz-Avila, J. William Murdock, Dan Wu, and Fusun Yaman. Applications of SHOP and SHOP2. IEEE Intelligent Systems, 20(2):34-41, 2005. [ bib | .pdf ]
[NCLMA99] Dana S. Nau, Yue Cao, Amnon Lotem, and Héctor Muñoz-Avila. SHOP: Simple Hierarchical Ordered Planner. In Dean [Dea99], pages 968-975. [ bib | .pdf ]
[NSE98] Dana S. Nau, Stephen J. J. Smith, and Kutluhan Erol. Control strategies in HTN planning: Theory versus practice. In AAAI/IAAI, pages 1127-1133, 1998. [ bib | .pdf ]
[Oka98] Chris Okasaki. Purely Functional Data Structures. Cambridge University Press, Cambridge, UK, 1998. [ bib | .pdf ]
[ON04] O. Okhtay and D. Nau. A general approach to synthesize problem-specific planners, 2004. [ bib | .html ]
[Pnu77] Amir Pnueli. The temporal logic of programs. In IEEE [IEE77], pages 46-57. [ bib ]
[RN03] Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs, NJ, 2nd edition, 2003. [ bib | http ]
[Rov01] Marco Roveri. Planning in non-deterministic domains via symbolic model checking, 2001. [ bib | .html ]
[Sac75] Earl D. Sacerdoti. The nonlinear nature of plans. In IJCAI, pages 206-214, 1975. [ bib | .pdf ]
[SBNM02] T. Son, C. Baral, T. Nam, and S. McIlraith. Domain-dependent knowledge in answer set planning, 2002. [ bib | .html ]
[SPW+04] Evren Sirin, Bijan Parsia, Dan Wu, James A. Hendler, and Dana S. Nau. HTN planning for web service composition using SHOP2. J. Web Sem., 1(4):377-396, 2004. [ bib | http ]
[Tat77] Austin Tate. Generating project networks. In IJCAI, pages 888-893, 1977. [ bib | .pdf ]
[TCdB07] Felipe W. Trevizan, Fabio G. Cozman, and Leliane N. de Barros. Planning under risk and knightian uncertainty. In IJCAI, 2007. [ bib | .pdf ]
[Ull05] Carsten Ullrich. Course generation based on HTN planning. In Bauer et al. [BBF+05], pages 74-79. [ bib | .pdf ]
[vR01] Femke van Raamsdonk. Book review - logic in computer science: Modelling and reasoning about systems by michael r. a. huth and mark d. ryan, cambridge university press. TPLP, 1(1):123-125, 2001. [ bib ]
[Wil90] David E. Wilkins. Can AI planners solve practical problems? Computational Intelligence, 6:232-246, 1990. [ bib | .pdf ]
[WPS+03] Dan Wu, Bijan Parsia, Evren Sirin, James A. Hendler, and Dana S. Nau. Automating DAML-S web services composition using SHOP2. In Fensel et al. [FSM03], pages 195-210. [ bib | .pdf ]
[WSH+03] Dan Wu, Evren Sirin, James A. Hendler, Dana S. Nau, and Bijan Parsia. Automatic web services composition using SHOP2. In WWW (Posters), 2003. [ bib | .pdf ]
[Yan90] Qiang Yang. Formalizing planning knowledge for hierarchical planning. Computational Intelligence, 6:12-24, 1990. [ bib | .pdf ]

This file has been generated by bibtex2html 1.85.