论文信息 - A wizard's aid: efficient music constraint programming with Oz

A wizard's aid: efficient music constraint programming with Oz

Constraint programming has become increasingly popular for computer assisted composition, because it allows the composer to generate a musical score by describing a desired result. However, he does not need to specify, how to achieve this outcome. Using the constraint paradigm the composer can define arbitrary relations between score parameters. The system then searches for one or more solutions.

Torsten Anders

[1] Camilo Rueda,et al. Computer-Assisted Composition at IRCAM: From PatchWork to OpenMusic , 1999, Computer Music Journal.

[2] Gert Smolka,et al. The Oz Programming Model , 1996, Computer Science Today.

[3] Philippe Codognet,et al. Yet Another Local Search Method for Constraint Solving , 2001, SAGA.

[4] David A. McAllester,et al. Screamer: A Portable Efficient Implementation of Nondeterministic Common LISP , 1993 .

[5] Philippe Codognet,et al. A Constraint Programming System for Music Composition , Preliminary Results , 2001 .

[6] Gert Smolka,et al. Finite Domain Constraint Programming in Oz. A Tutorial , 1998 .

[7] Torsten Anders. Arno: Constraints Programming in Common Music , 2000, ICMC.

[8] Peter Van Roy,et al. Concepts, Techniques, and Models of Computer Programming , 2004 .

[9] LaursonMikael,et al. Computer-Assisted Composition at IRCAM: From PatchWork to OpenMusic , 1999 .

[10] Heinrich Taube. An Introduction to Common Music , 1997 .

[11] Martin Henz,et al. COMPOzE-intention-based music composition through constraint programming , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.