Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/s00500-004-0389-0 | Soft Comput. |
Keywords | Field | DocType |
Local Search,Search Algorithm,Acoustics,Constraint Satisfaction,Partial Information | Computer science,Theoretical computer science,Artificial intelligence,Backtracking,Constraint logic programming,Constraint satisfaction,Local consistency,Mathematical optimization,Constraint programming,Constraint satisfaction problem,Constraint satisfaction dual problem,Machine learning,Binary constraint | Journal |
Volume | Issue | ISSN |
8 | 9 | 1432-7643 |
Citations | PageRank | References |
17 | 1.08 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Truchet | 1 | 37 | 2.16 |
| P. Codognet | 2 | 17 | 1.76 |