31 citations · 104 across the 14 of their papers we have counts for
1 paper · 1 filter
Omer Giménez
We show that solving planning domains on binary variables with polytree causal graph is \NP-complete. This is in contrast to a polynomial-time algorithm of Domshlak and Brafman tha…