Towards Fully Observable Non-Deterministic Planning as Assumption-based Automatic Synthesis
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Special Track on Knowledge Representation and Reasoning. Pages 3200-3205.
Abstract
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.
@inproceedings{ijcai2015p451,
title = {Towards Fully Observable Non-Deterministic Planning as Assumption-based Automatic Synthesis},
author = {Sardina, Sebastian and D'Ippolito, Nicolás},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-15}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Qiang Yang and Michael Wooldridge},
pages = {3200--3205},
year = {2015},
month = {7},
note = {Special Track on Knowledge Representation and Reasoning},
url = {https://ijcai.org/proceedings/2015/451},
}
TY - CPAPER TI - Towards Fully Observable Non-Deterministic Planning as Assumption-based Automatic Synthesis AU - Sardina, Sebastian AU - D'Ippolito, Nicolás T2 - Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15 PB - International Joint Conferences on Artificial Intelligence PY - 2015 SP - 3200 EP - 3205 UR - https://ijcai.org/proceedings/2015/451 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
