<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>7662</REFNUM><AUTHORS><AUTHOR>Gregory,P.</AUTHOR><AUTHOR>Miller,A.</AUTHOR><AUTHOR>Prosser,P.</AUTHOR></AUTHORS><YEAR>2004</YEAR><TITLE>Solving the Rehearsal Problem with Planning and with Model Checking</TITLE><PLACE_PUBLISHED>16th European Conference on Artificial Intelligence (ECAI 2004), workshop W14: Modelling and Solving Problems with Constraints </PLACE_PUBLISHED><PUBLISHER>N/A</PUBLISHER><PAGES>157--171</PAGES><LABEL>Gregory:2004:7662</LABEL><KEYWORDS><KEYWORD>constraint satisfaction; planning; model checking;</KEYWORD></KEYWORDS<ABSTRACT>Planning problems have been modelled and solved as constraint satisfaction problems. Similarly, model checking problems have been modelled and solved as constraint satisfaction problems. 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, using both planning and model checking technologies. Both of these technologies compete with the more encoding, the constraint programming solution, in terms of search time. </ABSTRACT></RECORD></RECORDS></XML>