Solving the rehearsal problem with planning and model checking

Gregory, Peter and Miller, Alice and Prosser, Patrick (2004) Solving the rehearsal problem with planning and model checking. In: Proceedings of ECAI'04 Workshop on Modelling and Solving Problems with Constraints, 2004-08-22 - 2004-08-27.

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.

• Share and Export
  

  RDF+XMLBibTeXRIOXX2 XMLRDF+N-TriplesJSONDublin CoreAtomSimple MetadataReferMETSArchivematicaHTML CitationASCII CitationOpenURL ContextObjectEndNoteOpenURL ContextObject in SpanMODSMPEG-21 DIDLEP3 XMLData Cite XMLRIS (EndNote Online, Zotero, Ref manager, etc)RDF+N3Multiline CSV
• Item metadata

  Item type:	Conference or Workshop Item(Paper)
  ID code:	1947
  Dates:	Date Event August 2004 Published
  Keywords:	planning technology, model checking, Electronic computers. Computer science, Computer Science(all)
  Subjects:	Science > Mathematics > Electronic computers. Computer science
  Department:	Faculty of Science > Computer and Information Sciences Faculty of Science > Computer and Information Sciences > Computer Science
  Depositing user:	Strathprints Administrator
  Date deposited:	02 Nov 2006
  Last modified:	02 Jul 2021 00:49
  URI:	https://strathprints.strath.ac.uk/id/eprint/1947