Flexible FOND Planning with Explicit Fairness Assumptions
From MaRDI portal
Publication:5094037
DOI10.1613/JAIR.1.13599OpenAlexW3175609846WikidataQ114594307 ScholiaQ114594307MaRDI QIDQ5094037FDOQ5094037
Authors: Ivan D. Rodriguez, Sebastian Sardiña, Blai Bonet, Hector Geffner 
Publication date: 2 August 2022
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.08391
Recommendations
- Fully observable non-deterministic planning as assumption-based reactive synthesis
- Fast strong planning for fully observable nondeterministic planning problems
- Qualitative numeric planning: reductions and complexity
- The planning spectrum - one, two, three, infinity
- Weak, strong, and strong cyclic planning via symbolic model checking
Cites Work
- Multi-shot ASP solving with clingo
- Practical synthesis of reactive systems from LTL specifications via parity games
- Title not available (Why is that?)
- Conflict-driven answer set solving: from theory to practice
- Weak, strong, and strong cyclic planning via symbolic model checking
- Title not available (Why is that?)
- Synthesis of Reactive(1) designs
- A Concise Introduction to Models and Methods for Automated Planning
- A new representation and associated algorithms for generalized planning
- Title not available (Why is that?)
- Fully observable non-deterministic planning as assumption-based reactive synthesis
- Answer set programming
- Qualitative numeric planning: reductions and complexity
Uses Software
This page was built for publication: Flexible FOND Planning with Explicit Fairness Assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094037)
