Solving the rehearsal problem with planning and with model checking

Gregory, P., Miller, A. and Prosser, P. (2004) Solving the rehearsal problem with planning and with model checking. In: Workshop on Modelling and Solving Problems with Constraints, Valencia, Spain, 22 Aug 2004, pp. 157-171.

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.

• Item Type: Conference Proceedings
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Miller, Professor Alice and Prosser, Dr Patrick
• Authors: Gregory, P., Miller, A., and Prosser, P.
• College/School: College of Science and Engineering > School of Computing Science