Generalized planning with loops under strong fairness constraints

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2010, Pages 351-361

  De Giacomo, Giuseppe ^a   Patrizi, Fabio ^a   Sardina, Sebastian ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b RMIT UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONDITIONAL PLANNING; EXPTIME; FAIRNESS CONSTRAINTS; GENERALIZED PLANNING; PLANNING DOMAINS; PLANNING PROJECTS; REACHABILITY;

KNOWLEDGE REPRESENTATION;

EID: 84860600231     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Accellera. 2004. Property Specification Language Reference Manual. www.eda.org/vfv/docs/PSL-v1.1.pdf.
2. Armoni, R.; Fix, L.; Flaisher, A.; Gerth, R.; Ginsburg, B.; Kanza, T.; Landver, A.; Mador-Haim, S.; Singerman, E.; Tiemeyer, A.; Vardi, M. Y.; and Zbar, Y. 2002. The For- Spec temporal logic: A new temporal property- specification language. In Proceedings of the TACAS'02, 296-211.
3. Bacchus, F., and Kabanza, F. 1998. Planning for temporally extended goals. Annals of Mathematics and Artificial Intelligence 22:5-27.
4. Baier, J. A.; Bacchus, F.; and McIlraith, S. A. 2009. A heuristic search approach to planning with temporally extended preferences. Artificial Intelligence Journal 173(5- 6):593-618.
5. Calvanese, D.; De Giacomo, G.; and Vardi, M. Y. 2002. Reasoning about actions and planning in LTL action theories. In Proc. of KR'02, 593-602.
6. Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. 2003. Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence Journal 147(1- 2):35-84.
7. Clarke, E. M.; Grumberg, O.; and Peled, D. A. 1999. Model checking. Cambridge, MA, USA: The MIT Press.
8. De Giacomo, G., and Sardina, S. 2007. Automatic synthesis of new behaviors from a library of available behaviors. In Veloso, M. M., ed., Proc. of IJCAI'07, 1866-1871.
9. De Giacomo, G., and Vardi, M. Y. 2000. Automata-theoretic approach to planning for temporally extended goals. In Proc. of ECP'99, 226-238.
10. De Giacomo, G.; Patrizi, F.; and Sardina, S. 2010. Agent programming via planning programs. In Proc. of AAMAS' 10. To appear.
11. Ghallab, M.; Nau, D. S.; and Traverso, P. 2004. Automated Planning: Theory and Practice. Morgan Kaufmann.
12. Kerjean, S.; Kabanza, F.; St.-Denis, R.; and Thiébaux, S. 2006. Analyzing LTL model checking techniques for plan synthesis and controller synthesis (work in progress). Electronic Notes in Theoretical Comp. Science 149(2):91-104.
13. Kesten, Y.; Piterman, N.; and Pnueli, A. 2005. Bridging the gap between fair simulation and trace inclusion. Information and Computation 200(1):35 - 61.
14. Kupferman, O.; Piterman, N.; and Vardi, M. Y. 2006. Safraless compositional synthesis. In Proc. of CAV'06, 31-44.
15. Piterman, N.; Pnueli, A.; and Sa'ar, Y. 2006. Synthesis of reactive(1) designs. In Proc. of VMCAI'06, volume 3855 of Lecture Notes in Computer Science (LNCS), 364-380. Springer.
16. Pnueli, A., and Rosner, R. 1989. On the Synthesis of a Reactive Module. In Proc. of POPL'89, 179-190.
17. Rintanen, J. 2004. Complexity of planning with partial observability. In Proc. of ICAPS'04.
18. Sardina, S.; De Giacomo, G.; Lespérance, Y.; and Levesque, H. J. 2006. On the Limits of Planning over Belief States. In Proc. of KR'06, 463-471.
19. Sardina, S.; Patrizi, F.; and De Giacomo, G. 2008. Behavior composition in the presence of failure. In Proc. of KR'08, 640-650.
20. Vardi, M. Y. 1996. An Automata-Theoretic Approach to Linear Temporal Logic. In Logics for Concurrency: Structure versus Automata. Springer.
21. Vardi, M. Y. 2007. Automata-theoretic model checking revisited. In Proc. VMCAI'07, 137-150.