Solving the rehearsal problem with planning and model checking

Peter Gregory, Alice Miller, Patrick Prosser

Research output: Contribution to conferencePaper

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.
Original languageEnglish
Number of pages15
Publication statusPublished - Aug 2004
EventProceedings of ECAI'04 Workshop on Modelling and Solving Problems with Constraints - Valencia, Spain
Duration: 22 Aug 200427 Aug 2004

Conference

ConferenceProceedings of ECAI'04 Workshop on Modelling and Solving Problems with Constraints
CityValencia, Spain
Period22/08/0427/08/04

Keywords

  • planning technology
  • model checking

Fingerprint Dive into the research topics of 'Solving the rehearsal problem with planning and model checking'. Together they form a unique fingerprint.

Cite this