Musical Constraint Satisfaction Problems Solved with Adaptive Search

Charlotte Truchet (1) , Philippe Codognet (2)

1 Repmus - Représentations musicales
2 UPMC - Université Pierre et Marie Curie - Paris 6

Constraint Programming (CP) allows to modelize and solve combinatory problems by specifying some partial information on variables, unknowns of the problem.We have studied musical constraint problems, either stated by contemporary composers, or of musical analysis, or instrumentation, in collaboration with IRCAM. Fourteen such problems have been modelized and solved, which allowed to give a detailed typology. This has been used to conceive and implement OMClouds, a library in the Computer Assisted Composition environment OpenMusic. It is based on a local search algorithm called adaptive search. Its architecture allows in particular to define a constraint problem visually, to solve it, and eventually to edit partial or approached results during the resolution process.

Mots clés: Computer Assisted Composition; Adaptive search; Constraints; OpenMusic

Mots clés: Informatique musicale

Domaines: Langage de programmation [cs.PL]; Son [cs.SD]; Traitement du signal et de l'image [eess.SP]; Machine Learning [stat.ML]; Intelligence artificielle [cs.AI]; Théorie et langage formel [cs.FL]; Musique, musicologie et arts de la scène

Charlotte Truchet, Philippe Codognet. Musical Constraint Satisfaction Problems Solved with Adaptive Search. Soft Computing, 2004, 8 (9), pp.633-640. ⟨hal-01161219⟩