Solving the Rehearsal Problem with Planning and with Model Checking
Peter J. Gregory, Alice Ann Miller, Patrick Prosser · 2004
Abstract. Planning problems have been modelled and solved as constraint satisfaction problems [1–4]. Similarly, model checking problems have been modelled and solved as constraint satisfaction problems [5, 6]. In this paper we show that, conversely, planning and model checking techniques can each be applied to a constraint satisfaction problem. We demonstrate this by modelling and solving what might generally be accepted as a constraint satisfaction problem, the rehearsal problem [7], using both planning and model checking technologies. Both of these technologies compete with the more natural encoding, the constraint programming solution, in terms of search time. 1