All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others

Christer Bäckström, Peter Jonsson. All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others. In Daniel Borrajo, Maxim Likhachev, Carlos Linares López, editors, Proceedings of the Fourth Annual Symposium on Combinatorial Search, SOCS 2011, Castell de Cardona, Barcelona, Spain, July 15.16, 2011. pages 10-17, AAAI Press, 2011. [doi]

Abstract

Abstract is missing.