---
title: "Towards Fully Observable Non-Deterministic Planning as Assumption-based Automatic Synthesis"
authors:
  - "Sebastian Sardiña"
  - "Nicolás D'Ippolito"
doi: ""
url: "https://ijcai.org/proceedings/2015/451"
pdf: "https://ijcai.org/proceedings/2015/0451.pdf"
venue: "Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence"
year: 2015
pages: "3200-3205"
track: "Special Track on Knowledge Representation and Reasoning"
keywords:
---

# Towards Fully Observable Non-Deterministic Planning as Assumption-based Automatic Synthesis

Sebastian Sardiña, Nicolás D'Ippolito

*Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence*, 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.