Characterizing Difficult Problem Classes

• There is a nice theory of Serializability for conjunctive planning

• There is no clean theory yet of what makes a problem easy or hard for disjunctive planners

  • Hardness characterizations in CSP/SAT can be used.

Previous slide

Next slide

Back to first slide

View graphic version