Updates, actions, and planning

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 119-124

  Herzig, Andreas ^a   Lang, Jérôme ^a   Marquis, Pierre ^b   Polacsek, Thomas ^a  

^a IRIT   (France)

^b UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION EFFECT; CONCURRENT UPDATE; PLAN VERIFICATIONS; UPDATE OPERATORS;

ARTIFICIAL INTELLIGENCE;

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

References (23)

1. C. R. Baral, V. Kreinovich, and R. Trejo. Computational complexity of planning and approximate planning in presence of incompleteness. In Proc. of IJCAI'99, pages 948-955, 1999.
2. G. Brewka and J. Hertzberg. How to do things with worlds: on formalizing actions and plans. J. of Logic and Computation, 3(5):517-532, 1993.
3. M.O. Cordier and P. Siegel. Prioritized transitions for updates. In Proc. of ECSQARU'95, pages 142-150. LNAI 946, Springer-Verlag, 1995.
4. C. da Costa, F. Garcia, J. Lang, and R. Martin-Clouaire. Possibilistic planning: Representation and complexity. In Proc. of ECP'97, pages 143-155, 1997.
5. A. del Val and Y. Shoham. Deriving properties of belief update from theories of action. J. of Logic, Language, and Information, 3:81-119, 1994.
6. P. Doherty, W. Łukasziewicz, and E. Madalińska-Bugaj. The PMA and relativizing change for action update. In Proc. of KR'98, pages 258-269, 1998.
7. H. Fargier, J. Lang, and P. Marquis. Propositional logic and one-stage decision making. In Proc. of KR'2000, pages 445-456, 2000.
8. P. Ferraris and E. Giunchiglia. Planning as satisfiability in nondeterministic domains. In Proc. of AAAI'00, pages 748-753, 2000.
9. H. Geffner. A qualitative model for temporal reasoning with incomplete information. In Proc. of AAAI'96, pages 1176-1181, 1996.
10. E. Giunchiglia and V. Lifschitz. An action language based on causal explanation: Preliminary report. In Proc. of AAAI'98, pp. 623-630, 1998.
11. E. Giunchiglia. Planning as satisfiability with expressive action languages: Concurrency, constraints, and nondeterminism. In Proc. of KR'2000, pages 657-666, 2000.
12. P. Haslum and P. Jonsson. Some results on the complexity of planning with incomplete information. In Proc. of ECP'99, 308-318, 1999.
13. A. Herzig and O. Rifi. Propositional belief update and minimal change. Artificial Intelligence, 115:107-138, 1999. (Pubitemid 30522973)
14. A. Herzig, J. Lang, D. Longin, and T. Polacsek. A logic for planning under partial observability. In Proc. of AAAI'2000, pages 768-773, 2000.
15. H. Katsuno and A. Mendelzon. Propositional knowledge base revision and minimal change. Artificial Intelligence, 52:263-294, 1991.
16. J. Lang, P. Liberatore, and P. Marquis. Propositional independence, part I: formula-variable dependence and forgetting. Technical report, IRIT, 2000.
17. H. Levesque. A completeness result for reasoning with incomplete first-order knowledge bases. In Proc. of KR'98, pages 14-23, 1998.
18. P. Liberatore. The complexity of belief update. Artificial Intelligence, 119:141-190, 2000.
19. M. L. Littman. Probabilistic propositional planning: Representations and complexity. In Proc. of AAAI'97, pages 748-754, 1997.
20. N. McCain and H. Turner. Satisfiability planning with causal theories. In Proc. of KR'98, pages 212-223, 1998.
21. Ch. Papadimitriou. Computational complexity. Addison-Wesley, 1994.
22. J. Rintanen. Constructing conditional plans by a theorem prover. Journal of Artificial Intelligence Research, 10:323-353, 1999.
23. S. Shapiro, M. Pagnucco, Y. Lespérance, and H. J. Levesque. Iterated belief change in the situation calculus. In Proc. of KR'00, pages 527-538, 2000.