Musical constraint satisfaction problems solved with adaptive search

Authors:
C. Truchet;P. Codognet
Affiliations:
8 rue du Capitaine Scott, Institute Laboratoired’Informatique de Paris 6, 75015, Paris, Frankreich;8 rue du Capitaine Scott, Institute Laboratoired’Informatique de Paris 6, 75015, Paris, Frankreich
Venue:
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Year:
2004

Citing 0
Cited 7

Pwmc, a constraint-solving system for generating music scores

Computer Music Journal
Constraint application with higher-order programming for modeling music theories

Computer Music Journal
Constraint programming systems for modeling music theories and composition

ACM Computing Surveys (CSUR)
Building topological spaces for musical objects

MCM'11 Proceedings of the Third international conference on Mathematics and computation in music
Targeting the Cell Broadband Engine for constraint-based local search

Concurrency and Computation: Practice & Experience
FOCUS: a constraint for concentrating high costs

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Composing fifth species counterpoint music with a variable neighborhood search algorithm

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraint Programming (CP) allows to model 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 (french Institute for Research and Coordination Acoustics / Music). Fourteen such problems have been modeled 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.