Flexible FOND Planning with Explicit Fairness Assumptions

DOI10.1613/jair.1.13599OpenAlexW3175609846WikidataQ114594307 ScholiaQ114594307MaRDI QIDQ5094037

Sebastian Sardiña, Ivan D. Rodriguez, Blai Bonet, Héctor 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

knowledge representationplanning

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Uses Software

• Clingo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthesis of Reactive(1) designs
• A new representation and associated algorithms for generalized planning
• Weak, strong, and strong cyclic planning via symbolic model checking
• Conflict-driven answer set solving: from theory to practice
• Practical synthesis of reactive systems from LTL specifications via parity games
• A Concise Introduction to Models and Methods for Automated Planning
• Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis
• Qualitative Numeric Planning: Reductions and Complexity
• Multi-shot ASP solving with clingo
• Answer Set Programming

This page was built for publication: Flexible FOND Planning with Explicit Fairness Assumptions