Deals with the problem of generating sequences in the style of a given corpus, in text or music
Overcomes limitation of Markov models, they capture only local information, by formulating them as constraint satisfaction problems (CSPs)
Valuable for practitioners, researchers, and graduate students engaged with algorithmic composition and constraint satisfaction
This book deals with the problem of generating sequences in the style of a given corpus, in text or music. In particular, the authors study Markov models, which have long been used for capturing basic statistical information about how elements of a given alphabet are put together in representative sequences, formulating them as constraint satisfaction problems (CSPs), a formulation which opens the door to many extensions of basic Markov models through the modularity of constraint satisfaction.
The book will be valuable to practitioners, researchers, and graduate students engaged with algorithmic composition and constraint satisfaction.
