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

id	todo:paper_10450823_v2015-January_n_p3200_Sardina
record_format	dspace
spelling	todo:paper_10450823_v2015-January_n_p3200_Sardina2023-10-03T15:58:19Z Towards fully observable non-deterministic planning as assumption-based automatic synthesis 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 Artificial intelligence Automatic synthesis Correct solution Efficient synthesis Logical characterization Reactive synthesis Synthesis (chemical) 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. CONF info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_10450823_v2015-January_n_p3200_Sardina
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	Artificial intelligence Automatic synthesis Correct solution Efficient synthesis Logical characterization Reactive synthesis Synthesis (chemical)
spellingShingle	Artificial intelligence Automatic synthesis Correct solution Efficient synthesis Logical characterization Reactive synthesis Synthesis (chemical) 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 Towards fully observable non-deterministic planning as assumption-based automatic synthesis
topic_facet	Artificial intelligence Automatic synthesis Correct solution Efficient synthesis Logical characterization Reactive synthesis Synthesis (chemical)
description	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.
format	CONF
author	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
author_facet	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
author_sort	Sardina, S.
title	Towards fully observable non-deterministic planning as assumption-based automatic synthesis
title_short	Towards fully observable non-deterministic planning as assumption-based automatic synthesis
title_full	Towards fully observable non-deterministic planning as assumption-based automatic synthesis
title_fullStr	Towards fully observable non-deterministic planning as assumption-based automatic synthesis
title_full_unstemmed	Towards fully observable non-deterministic planning as assumption-based automatic synthesis
title_sort	towards fully observable non-deterministic planning as assumption-based automatic synthesis
url	http://hdl.handle.net/20.500.12110/paper_10450823_v2015-January_n_p3200_Sardina
work_keys_str_mv	AT sardinas towardsfullyobservablenondeterministicplanningasassumptionbasedautomaticsynthesis AT dippoliton towardsfullyobservablenondeterministicplanningasassumptionbasedautomaticsynthesis AT wooldridgem towardsfullyobservablenondeterministicplanningasassumptionbasedautomaticsynthesis AT yangq towardsfullyobservablenondeterministicplanningasassumptionbasedautomaticsynthesis AT alibabacomdepartmentofcomputerscienceandengineeringatuniversidadnacionaldelsurdepartmentofcomputerscienceattheschoolofexactandnaturalsciencesofbuenosairesuniversityetalinternationaljointconferencesonartificialintelligenceijcaiministryofsciencetechnologyan towardsfullyobservablenondeterministicplanningasassumptionbasedautomaticsynthesis
_version_	1807314671156330496

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

Ejemplares similares