Flexible FOND Planning with Explicit Fairness Assumptions
From MaRDI portal
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
- A Concise Introduction to Models and Methods for Automated Planning
- A new representation and associated algorithms for generalized planning
- Answer set programming
- Conflict-driven answer set solving: from theory to practice
- Fully observable non-deterministic planning as assumption-based reactive synthesis
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 1216123 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- Multi-shot ASP solving with clingo
- Practical synthesis of reactive systems from LTL specifications via parity games
- Qualitative numeric planning: reductions and complexity
- Synthesis of Reactive(1) designs
- Weak, strong, and strong cyclic planning via symbolic model checking
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)
