Solving planning domains with polytree causal graphs is NP-complete

Details Solving planning domains with polytree causal graphs is NP-complete Solving planning domains with polytree causal graphs is NP-complete

2006-10-16

arxiv.org/abs/cs/0610095v1

Computer Science

Artificial Intelligence

Scientific paper

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 that solves these planning domains for
polytree causal graphs of bounded indegree.

Affiliated with

Also associated with

No associations

Rating

Solving planning domains with polytree causal graphs is NP-complete does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving planning domains with polytree causal graphs is NP-complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving planning domains with polytree causal graphs is NP-complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-244573