Towards fully observable non-deterministic planning as assumption-based automatic synthesis

Mostrar otras versiones (1)

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
Autor principal: Sardina, S.
Otros Autores: 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: 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í
Biblioteca Central Dr. Luis F. Leloir (FCEN) de Universidad de Buenos Aires

Internet

Registro en Scopus
Handle
Registro en la Biblioteca Digital

Ejemplares similares