Registro:

Referencias:

• Abadi, M., Lamport, L., Wolper, P., Realizable and unrealizable specifications of reactive systems (1989) Proc. of the International Colloquium on Automata, Languages and Programming (ICALP), pp. 1-17
• Bloem, R., Jobstmann, B., Piterman, N., Pnueli, A., Sa'Ar, Y., Synthesis of reactive(1) designs (2012) Journal of Computer and System Sciences, 78 (3), pp. 911-938
• Cimatti, A., Pistore, M., Roveri, M., Traverso, P., Weak, strong, and strong cyclic planning via symbolic model checking (2003) Artificial Intelligence, 147 (1-2), pp. 35-84
• Clarke, E., Emerson, E., Design and synthesis of synchronization skeletons using branching time temporal logic (1982) Logics of Programs, Volume 131 of Lecture Notes in Computer Science (LNCS), pp. 52-71. , Dexter Kozen, editor chapter 5 Springer, Berlin/Heidelberg
• Daniele, M., Traverso, P., Vardi, M.Y., Strong cyclic planning revisited (1999) Proc. of the European Conference on Planning (ECP), pp. 35-48
• Daniele, M., Traverso, P., Vardi, M., Strong cyclic planning revisited (2000) Recent Advances in AI Planning, pp. 35-48
• De Giacomo, G., Patrizi, F., Felli, P., Sardina, S., Two-player game structures for generalized planning and agent composition (2010) Proc. of the National Conference on Artificial Intelligence (AAAI), pp. 297-302
• De Giacomo, G., Patrizi, F., Sardina, S., Generalized planning with loops under strong fairness constraints (2010) Proc. of the Int. Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 351-361
• D'Ippolito, N., Braberman, V.A., Piterman, N., Uchitel, S., Synthesis of live behaviour models for fallible domains (2011) Proceedings of the International Conference on Software Engineering, pp. 211-220
• Domshlak, C., Fault tolerant planning: Complexity and compilation (2013) Proc. of the International Conference on Automated Planning and Scheduling (ICAPS)
• Allen Emerson, E., Halpern, J.Y., "Sometimes" and "not never" revisited: On branching versus linear time temporal logic (1986) Journal of the ACM, 33 (1), pp. 151-178
• Fu, J., Ng, V., Bastani, F., Yen, I.-L., Simple and fast strong cyclic planning for fully-observable non-deterministic planning problems (2011) Proc. of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 1949-1954
• Geffner, H., Bonet, B., (2013) A Concise Introduction to Models and Methods for Automated Planning, , Morgan & Claypool Publishers
• Gerevini, A., Bonet, B., Givan, B., (2006) Booklet of 4th International Planning Competition, , Lake District, UK
• Giannakopoulou, D., Magee, J., Fluent model checking for event-based systems (2003) SIGSOFT Softw. Eng. Notes, 28 (5), pp. 257-266. , September
• Hoare, C.A.R., Communicating sequential processes (1978) Communications of the ACM, 21 (8), pp. 666-677
• Keller, R.M., Formal verification of parallel programs (1976) Communications of the ACM, 19, pp. 371-384
• Kupferman, O., Piterman, N., Vardi, M.Y., Safraless compositional synthesis (2006) Proc. of the International Conference on Computer Aided Verification (CAV), pp. 31-44
• Kuter, U., Nau, S., Reisner, E., Goldman, P., Using classical planners to solve nondeterministic planning problems (2008) Proc. of the International Conference on Automated Planning and Scheduling (ICAPS), pp. 190-197. , D. R
• Manna, Z., Waldinger, R., How to clear a block: A theory of plans (1987) Journal of Automed Reasoning, 4 (3), pp. 343-377
• Muise, C., McIlraith, S.A., Christopher Beck, J., Improved non-deterministic planning by exploiting state relevance (2012) Proc. of the International Conference on Automated Planning and Scheduling (ICAPS), pp. 172-180
• Patrizi, F., Lipovetzky, N., Geffner, H., Fair LTL synthesis for non-deterministic systems using strong cyclic planners (2013) Proc. of the International Joint Conference on Artificial Intelligence (IJCAI)
• Pistore, M., Traverso, P., Planning as model checking for extended goals in non-deterministic domains (2001) Proc. of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 479-486
• Piterman, N., Pnueli, A., Sa'Ar, Y., Synthesis of reactive(1) designs (2006) Proc. of the International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), Volume 3855 of Lecture Notes in Computer Science (LNCS), pp. 364-380. , Springer
• Pnueli, A., Rosner, R., On the synthesis of a reactive module (1989) Proc. of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 179-190
• Pnueli, A., The temporal logic of programs (1977) Proceedings of the 18th Annual Symposium on Foundations of Computer Science (SFCS), pp. 46-57
• Ramirez, M., Sardina, S., Directed fixed-point regression-based planning for non-deterministic domains (2014) Proc. of the International Conference on Automated Planning and Scheduling (ICAPS), pp. 235-243
• Rintanen, J., Complexity of planning with partial observability (2004) Proc. of the International Conference on Automated Planning and Scheduling (ICAPS), pp. 345-354
• Rintanen, J., Regression for classical and non-deterministic planning (2008) Proc. of the European Conference in Artificial Intelligence (ECAI), pp. 568-572A4 - Alibaba.com; Department of Computer Science and Engineering at Universidad Nacional del Sur; Department of Computer Science at the School of Exact and Natural Sciences of Buenos Aires University; et al.; International Joint Conferences on Artificial Intelligence (IJCAI); Ministry of Science, Technology and Productive Innovation

Citas:

---------- APA ----------

---------- CHICAGO ----------

---------- MLA ----------

---------- VANCOUVER ----------