1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LO2025
Formally Verified Certification of Unsolvability of Temporal Planning Problems
David Wang, Mohammad Abdulaziz
We present an approach to unsolvability certification of temporal planning. Our approach is based on encoding the planning problem into a network of timed automata, and then using…
cs.AI2019★ 1 cited
Efficiently Exploring Ordering Problems through Conflict-directed Search
Jingkai Chen, Cheng Fang, David Wang +2
In planning and scheduling, solving problems with both state and temporal constraints is hard since these constraints may be highly coupled. Judicious orderings of events enable so…