Planning with different forms of domain-dependent control knowledge - An answer set programming approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2173 LNAI, Issue , 2001, Pages 226-239

  Son, Tran Cao ^a   Baral, Chitta ^b   McIlraith, Sheila ^c  

^a New Mexico State University   (United States)

^b Arizona State University   (United States)

^c Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; ANSWER SET PROGRAMMING; CONSTRAINT SATISFACTION; PLANNING PROBLEM; PROCEDURAL KNOWLEDGE; TEMPORAL KNOWLEDGE;

COMPUTER PROGRAMMING LANGUAGES;

LOGIC PROGRAMMING;

EID: 84867805629     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45402-0_17     Document Type: Conference Paper

References (30)

1. F. Bacchus and F. Kabanza. Using temporal logics to express search control knowledge for planning. Artificial Intelligence, 116(1, 2):123-191, 2000.
2. F. Bacchus, H. Kautz, D. E. Smith, D. Long, H. Geffner, and J. Koehler. AIPS-00 Planning Competition, http://www.cs.toronto.edu/aips2000/.
3. C. Baral. Knowledge Representation, reasoning, and declarative problem solving with Answer sets (Book draft). 2001.
4. C. Baral and T. C. Son. Extending Con Golog to allow partial ordering. In ATAL, LNCS, Vol. 1757, pages 188-204, 1999.
5. A. Blum and M. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90:281-300, 1997.
6. B. Bonet and H. Geffner. Planning as heuristic search. Artificial Intelligence -Special issue on Heuristic Search, 129(1-2):5-33, 2001.
7. W. Burgard, A. B. Cremers, D. Fox, D. Hähnel, G. Lakemeyer, Schulz D., W. Steiner, and S. Thrun. The interactive museum tour-guide robot. In AAAI-98, pages 11-18, 1998.
8. T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69:161-204, 1994.
9. S. Citrigno, T. Eiter, W. Faber, G. Gottlob, C. Koch, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. The dlv system: Model generator and application frontends. In Proceedings of the 12th Workshop on Logic Programming, pages 128-137, 1997.
10. Y. Dimopoulos, B. Nebel, and J. Koehler. Encoding planning problems in nonmonotonic logic programs. In Proceedings of European Conference on Planning, pages 169-181, 1997.
11. P. Doherty and J. Kvarnstom. TALplanner: An Empirical Investigation of a Temporal Logic-based Forward Chaining Planner, TIME'99, 1999.
12. K. Erol, D. Nau, and V. S. Subrahmanian. Complexity, decidability and undecid-ability results for domain-independent planning. Artificial Intelligence, 76(1-2):75-88, 1995.
13. A. Finzi, F. Pirri, and R. Reiter. Open world planning in the situation calculus. In AAAI-00, page 754-760, 2000.
14. M. Gelfond. Posting on TAG-mailing list, 1999.
15. M. Gelfond and V. Lifschitz. Action languages. ETAI, 3(6), 1998.
16. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. JAIR, 14:253-302, 2001.
17. Y. C. Huang, B. Selman, and H. Kautz. Control knowledge in planning: Benefits and tradeoffs. In AAAI-99, pages 511-517, 1999.
18. H. Kautz and B. Selman. BLACKBOX: A new approach to the application of theorem proving to problem solving. In Workshop Planning as Combinatorial Search, AIPS-98.
19. H. Kautz and B. Selman. The role of domain-specific knowledge in the planning as satisfiability framework. In Proceedings of AIPS, 1998.
20. H. Levesque, R. Reiter, Y. Lesperance, F. Lin, and R. Scherl. GOLOG: A logic programming language for dynamic domains. Journal of Logic Programming, 31(1-3):59-84, 1997.
21. V. Lifschitz. Answer Set Planning. In ICLP'99, pages 23-37, 1999.
22. V. Lifschitz and H. Turner. Representing transition systems by logic programs. In LPNMR'99, pages 92-106, 1999.
23. A. Lotem and S. Dana Nau. New advances in GraphHTN: Identifying independent subproblems in large HTN domains. In AIPS, pages 206-215, 2000.
24. J. McCarthy and P. Hayes. Some philosophical problems from the standpoint of artificial intelligence. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 4, pages 463-502. Edinburgh University Press, Edinburgh, 1969.
25. S. McIlraith. Modeling and programming devices and web agents. In Proceedings of the NASA Goddard Workshop on Formal Approaches to Agent-Based Systems, LNCS, 2000.
26. D. Nau, Y. Cao, A. Lotem, and H. Muñoz-Avila. SHOP: Simple Hierarchical Ordered Planner. In AAAI-99, pages 968-973, 1999.
27. I. Niemelä and P. Simons. Smodels - an implementation of the stable model and well-founded semantics for normal logic programs. In ICLP & LPNMR, pages 420-429, 1997.
28. I. Niemelä, P. Simons, and T. Soininen. Stable model semantics for weight constraint rules. In LPNMR'99, pages 315-332, 1999.
29. L. Tuan and C. Baral. Effect of knowledge representation on model based planning: experiments using logic programming encodings. In AAAI Spring Symposium on "Answer Set Programming", pages 110-115, 2001.
30. D. Wilkins and M. desJardines. A call for knowledge-based planning. AI Magazine, 22(1):99-115, Spring 2001.