Approach for generating every delete-relaxed deadend of a classicial planning problem.
@inproceedings{muise2018drde,
title={Characterizing and Computing All Delete-Relaxed Dead-ends},
author={Christian Muise},
booktitle={Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS'18)},
year={2018}
}