Solving planning domains with polytree causal graphs is NP-complete

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/117530We 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 that solves these planning domains for polytree causal graphs of bounded indegree.Artificial IntelligenceComputational ComplexityI.2.8Solving planning domains with polytree causal graphs is NP-completetext