ITSAT: An Efficient SAT-Based Temporal Planner

DOI10.1613/JAIR.4697MaRDI QIDQ2941742zbMATH OpenOpenAlexFDO

Authors Masood Feyzbakhsh Rankooh, Gholamreza Ghassem-Sani

Publication date 25 August 2015

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.4697

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Using satisfiability for non-optimal temporal planning
• Efficient Temporal Satisfiability
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• SMT-based abstract parametric temporal planning
• On Solving Soft Temporal Constraints Using SAT Techniques
• Temporal induction by incremental SAT solving
• STCSP -- structured temporal constraint satisfaction problems

Cited in

(8)

• Extracting mutual exclusion invariants from lifted temporal planning domains
• Decidability and complexity of action-based temporal planning over dense time
• Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I
• Processes and continuous change in a SAT-based planner
• Using satisfiability for non-optimal temporal planning
• SAT vs. search for qualitative temporal reasoning
• Temporal planning using subgoal partitioning and resolution in SGPlan
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism

This page was built for publication: ITSAT: An Efficient SAT-Based Temporal Planner

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941742)