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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Sardina, S., D'Ippolito, N., Wooldridge M., Yang Q., 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
Formato: CONF
Materias:
Artificial intelligence
Automatic synthesis
Correct solution
Efficient synthesis
Logical characterization
Reactive synthesis
Synthesis (chemical)
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_10450823_v2015-January_n_p3200_Sardina
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares