An approximation of action theories of AL and its application to conformant planning

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

Volumn 3662 LNAI, Issue , 2005, Pages 172-184

  Son, Tran Cao ^a   Tu, Phan Huy ^a   Gelfond, Michael ^b   Morales, A Ricardo ^b  

^a New Mexico State University   (United States)

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; THEOREM PROVING;

ACTION THEORIES; CONFORMANT PLANNING;

LOGIC PROGRAMMING;

EID: 33646030914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11546207_14     Document Type: Conference Paper

References (30)

1. F. Bacchus. The AIPS'00 Planning Competition. AI Magazine, 22(3), 2001.
2. C. Baral. Reasoning about Actions : Non-deterministic effects, Constraints and Qualification. In IJCAI'95, 2017-2023.
3. C. Baral, V. Kreinovich, and R. Trejo. Computational complexity of planning and approximate planning in the presence of incompleteness. Artificial Intelligence, 122:241-267, 2000.
4. C. Baral and M. Gelfond. Reasoning agents in dynamic domains. In J. Minker, editor, Logic-Based Artificial Intelligence, pages 257-279. Kluwer Academic Publishers, 2000.
5. B. Bonet and H. Geffner. GPT: a tool for planning with uncertainty and partial information. In IJCAI-0I Workshop on Planning with Uncertainty and Partial Information, 82-87, 2001.
6. R. Brafman and J. Hoffmann. Conformant planning via heuristic forward search: A new approach. In (ICAPS-04), 355-364.
7. D. Bryce and S. Kambhampati. Heuristic Guidance Measures for Conformant Planning. In (ICAPS-04), 365-375, 2004.
8. C. Castellini, E. Giunchiglia, and A. Tacchella. SAT-based Planning in Complex Domains: Concurrency, Constraints and Nondeterminism. Artificial Intelligence, 147:85-117, 2003.
9. A. Cimatti and M. Roveri. Conformant Planning via Symbolic Model Checking. Journal of Artificial Intelligence Research, 13:305-338, 2000.
10. A. Cimatti, M. Roveri, and P. Bertoli. Conformant Planning via Symbolic Model Checking and Heuristic Search. Artificial Intelligence Journal, 159:127-206, 2004.
11. S. Edelkamp, J. Hoffmann, M. Littman, and H. Younes. The IPC-2004 Planning Competition, 2004. http://ls5-www.cs.uni-dortmund.de/~edelkamp/ipc-4/.
12. κ System. AIJ, 144(1-2):157-211, 2003.
13. M. Gelfond and R. Morales. Encoding conformant planning in a-prolog. DRT'04.
14. M. Ghallab et al. PDDL -the Planning Domain Definition Language. Version 1.2. Technical Report CVC TR98003/DCS TR1165, Yale Center for Comp, Vis and Ctrl, 1998.
15. E. Giunchiglia, G. Kartha, and V. Lifschitz. Representing action: indeterminacy and ramifications. Artificial Intelligence, 95:409-443, 1997.
16. Y. Lierler and M. Maratea. Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. In LPNMR'04, 346-350, LNCS 2923, 2004.
17. V. Lifschitz. On the Logic of Causal Explanation (Research Note). AIJ,96(2):451-465.
18. F. Lin. Embracing causality in specifying the indirect effects of actions. IJCAI'95, 1985-93.
19. D. Long and M. Fox. The 3rd International Planning Competition: Results and Analysis. JAIR, 20:1-59, 2003.
20. N. McCain & H. Turner. A causal theory of ramifications and qualifications. IJCAI'95, 1978-1984.
21. N. McCain & M. Turner. Causal theories of action and change. AAAI'97, 460-467.
22. S. Mcllraith. Intergrating actions and state constraints: A closed-form solution to the ramification problem (sometimes). Artificial Intelligence, 116:87-121, 2000.
23. M. Shanahan. The ramification problem in the event calculus. In IJCAI'99, 140-146, 1999.
24. P. Simons, N. Niemelä, and T. Soininen. Extending and Implementing the Stable Model Semantics. Artificial Intelligence, 138(l-2):181-234, 2002.
25. D. Smith and D. Weld. Conformant graphplan. In Proceedings of AAAI 98, 1998.
26. T.C. Son and C. Baral. Formalizing sensing actions - a transition function based approach. Artificial Intelligence, 125(1-2):19-91, January 2001.
27. T.C. Son, C. Baral, N. Tran, and S. Mcllraith. Domain-Dependent Knowledge in Answer Set Planning. To appear in TOCL.
28. T.C. Son, P.H. Tu, M. Gelfond, and R. Morales. Conformant Planning for Domains with Constraints -A New Approach. To Appear in AAAI'05.
29. S. Thiebaux, J. Hoffmann, and B. Nebel. In Defense of PDDL Axioms. IJCAI'03.
30. H. Turner. Polynomial-length planning spans the polynomial hierarchy. JELIA'02, 111-124.