Constraint-Based Composition in Realtime
Constraint-Based Composition in Realtime
复制标题
基于约束的实时合成
DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
E. Miranda
中科院分区：
文献类型：
--
作者：
Torsten Anders;E. Miranda
提出了一种基于约束的实时算法合成方法。据我们所知，约束编程——执行搜索——之前还没有被用于实时的音乐创作。本文的主要贡献是一个带超时的元求解器。我们将音乐创作过程分解为每个时间步一个子约束问题和求解器调用。元求解器被赋予最大搜索时间：如果在最大搜索时间过后没有找到解决方案，则搜索终止。在这种情况下，用户定义要做什么。这样，系统就不会太长时间忙碌，并且总是对新的实时输入做出响应。本研究扩展了我们的音乐约束系统Strasheela的实时功能。Strasheela基于多范式编程语言Oz。我们的元求解器利用了声明性并发（并发约束编程加上一级过程）和基于计算空间的约束编程的范式。
This paper proposes an approach for constraint-based algorithmic composition in realtime. To our knowledge, constraint programming – which performs a search – has not been used for music composition in realtime before. The main contribution of this paper is a meta-solver with a timeout. We decompose the music creation process into one sub-constraint-problem and solver call per time step. The meta-solver is given a maximum search time: if no solution was found after the maximum search time elapsed, then the search is terminated. The user defines what to do in this case. That way, the system is never busy for too long and always responses to new realtime input. This research extends our music constraint system Strasheela with realtime capabilities. Strasheela is based on the multi-paradigm programming language Oz. Our metasolver exploits its paradigms of declarative concurrency (concurrent constraint programming plus first-class procedures) and constraint programming based on computation spaces.