Which of the following is true?
- GraphPlan has running time big-O of the running time of constructing a planning graph.
- OO-like ontologies are called lower ontologies.
- If the plan which results from the Ignore Precondition Heuristics fails to have a solution, so did the original problem.