Flexible FOND Planning with Explicit Fairness Assumptions

DOI10.1613/JAIR.1.13599MaRDI QIDQ5094037zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

planningknowledge representation

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

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

• 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?)
• 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
• 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

Describes a project that uses

Uses Software

• Clingo

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)