Towards fully observable non-deterministic planning as assumption-based automatic synthesis
Whereas previous work on non-deterministic planning has focused on characterizing (and computing) "loopy" but "closed" plans, we look here at the kind of environments that these plans are to be executed in. In particular, we provide a logical characterization of the standard &quo...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | , , , |
| Formato: | Acta de conferencia Capítulo de libro |
| Lenguaje: | Inglés |
| Publicado: |
International Joint Conferences on Artificial Intelligence
2015
|
| Acceso en línea: | Registro en Scopus Handle Registro en la Biblioteca Digital |
| Aporte de: | Registro referencial: Solicitar el recurso aquí |
| LEADER | 08968caa a22007457a 4500 | ||
|---|---|---|---|
| 001 | PAPER-13892 | ||
| 003 | AR-BaUEN | ||
| 005 | 20230518204420.0 | ||
| 008 | 190411s2015 xx ||||fo|||| 10| 0 eng|d | ||
| 024 | 7 | |2 scopus |a 2-s2.0-84949784253 | |
| 040 | |a Scopus |b spa |c AR-BaUEN |d AR-BaUEN | ||
| 100 | 1 | |a Sardina, S. | |
| 245 | 1 | 0 | |a Towards fully observable non-deterministic planning as assumption-based automatic synthesis |
| 260 | |b International Joint Conferences on Artificial Intelligence |c 2015 | ||
| 506 | |2 openaire |e Política editorial | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a Daniele, M., Traverso, P., Vardi, M.Y., Strong cyclic planning revisited (1999) Proc. of the European Conference on Planning (ECP), pp. 35-48 | ||
| 504 | |a Daniele, M., Traverso, P., Vardi, M., Strong cyclic planning revisited (2000) Recent Advances in AI Planning, pp. 35-48 | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a Domshlak, C., Fault tolerant planning: Complexity and compilation (2013) Proc. of the International Conference on Automated Planning and Scheduling (ICAPS) | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a Geffner, H., Bonet, B., (2013) A Concise Introduction to Models and Methods for Automated Planning, , Morgan & Claypool Publishers | ||
| 504 | |a Gerevini, A., Bonet, B., Givan, B., (2006) Booklet of 4th International Planning Competition, , Lake District, UK | ||
| 504 | |a Giannakopoulou, D., Magee, J., Fluent model checking for event-based systems (2003) SIGSOFT Softw. Eng. Notes, 28 (5), pp. 257-266. , September | ||
| 504 | |a Hoare, C.A.R., Communicating sequential processes (1978) Communications of the ACM, 21 (8), pp. 666-677 | ||
| 504 | |a Keller, R.M., Formal verification of parallel programs (1976) Communications of the ACM, 19, pp. 371-384 | ||
| 504 | |a Kupferman, O., Piterman, N., Vardi, M.Y., Safraless compositional synthesis (2006) Proc. of the International Conference on Computer Aided Verification (CAV), pp. 31-44 | ||
| 504 | |a 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 | ||
| 504 | |a Manna, Z., Waldinger, R., How to clear a block: A theory of plans (1987) Journal of Automed Reasoning, 4 (3), pp. 343-377 | ||
| 504 | |a 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 | ||
| 504 | |a 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) | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a Pnueli, A., The temporal logic of programs (1977) Proceedings of the 18th Annual Symposium on Foundations of Computer Science (SFCS), pp. 46-57 | ||
| 504 | |a 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 | ||
| 504 | |a Rintanen, J., Complexity of planning with partial observability (2004) Proc. of the International Conference on Automated Planning and Scheduling (ICAPS), pp. 345-354 | ||
| 504 | |a 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 | ||
| 520 | 3 | |a Whereas previous work on non-deterministic planning has focused on characterizing (and computing) "loopy" but "closed" plans, we look here at the kind of environments that these plans are to be executed in. In particular, we provide a logical characterization of the standard "fairness" assumption used, and show that strong cyclic plans are correct solution concepts for fair environments. We argue then that such logical characterization allows us to recast non-deterministic planning as a reactive synthesis task, and show that for a special case, recent efficient synthesis techniques can be applied. |l eng | |
| 593 | |a School of Computer Science and IT, RMIT University, Melbourne, Australia | ||
| 593 | |a Departamento de Computación, FCEN, Universidad de Buenos Aires, Buenos Aires, Argentina | ||
| 690 | 1 | 0 | |a ARTIFICIAL INTELLIGENCE |
| 690 | 1 | 0 | |a AUTOMATIC SYNTHESIS |
| 690 | 1 | 0 | |a CORRECT SOLUTION |
| 690 | 1 | 0 | |a EFFICIENT SYNTHESIS |
| 690 | 1 | 0 | |a LOGICAL CHARACTERIZATION |
| 690 | 1 | 0 | |a REACTIVE SYNTHESIS |
| 690 | 1 | 0 | |a SYNTHESIS (CHEMICAL) |
| 700 | 1 | |a D'Ippolito, N. | |
| 700 | 1 | |a Wooldridge M. | |
| 700 | 1 | |a Yang Q. | |
| 700 | 1 | |a 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 | |
| 711 | 2 | |d 25 July 2015 through 31 July 2015 |g Código de la conferencia: 116754 | |
| 773 | 0 | |d International Joint Conferences on Artificial Intelligence, 2015 |g v. 2015-January |h pp. 3200-3206 |p IJCAI Int. Joint Conf. Artif. Intell. |n IJCAI International Joint Conference on Artificial Intelligence |x 10450823 |z 9781577357384 |t 24th International Joint Conference on Artificial Intelligence, IJCAI 2015 | |
| 856 | 4 | 1 | |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-84949784253&partnerID=40&md5=6f15efbc1765521e6b0f9f82fd8ee9eb |y Registro en Scopus |
| 856 | 4 | 0 | |u https://hdl.handle.net/20.500.12110/paper_10450823_v2015-January_n_p3200_Sardina |y Handle |
| 856 | 4 | 0 | |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_10450823_v2015-January_n_p3200_Sardina |y Registro en la Biblioteca Digital |
| 961 | |a paper_10450823_v2015-January_n_p3200_Sardina |b paper |c PE | ||
| 962 | |a info:eu-repo/semantics/conferenceObject |a info:ar-repo/semantics/documento de conferencia |b info:eu-repo/semantics/publishedVersion | ||