Musical constraint satisfaction problems solved with adaptive search

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...

Full description

Saved in:
Bibliographic Details
Published in:Soft computing (Berlin, Germany) Germany), 2004-09, Vol.8 (9), p.633-640
Main Authors: Truchet, C., Codognet, P.
Format: Article
Language:English
Subjects:
Adaptive algorithms
Adaptive search techniques
Artificial Intelligence
Computer Science
Constraint modelling
Formal Languages and Automata Theory
Humanities and Social Sciences
Machine Learning
Musicology and performing arts
Programming Languages
Search algorithms
Signal and Image Processing
Sound
Statistics
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1432-7643
1433-7479
DOI:10.1007/s00500-004-0389-0