1. Aldinger, J., Mattmüller, R., Göbelbecker, M.: Complexity issues of interval relaxed numeric planning. In: Proceedings of the ICAPS-15 Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP 2015), pp. 4–12 (2015)
2. Bäckström, C., Nebel, B.: Complexity results for SAS
$$^+$$
planning. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI 1993), pp. 1430–1435 (1993)
3. Bofill, M., Arxer, J.E., Villaret, M.: The RANTANPLAN planner: system description. In: Proceedings of the ICAPS-15 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAPS 2015), pp. 1–10 (2015)
4. Bylander, T.: The Computational Complexity of Propositional STRIPS Planning. Artificial Intelligence 69, 165–204 (1994)
5. Coles, A., Fox, M., Long, D., Smith, A.: A hybrid relaxed planning graph-LP heuristic for numeric planning domains. In: Proceedings of the 20th International Conference on Automated Planning and Search (ICAPS 2008), pp. 52–59 (2008)