“…Some interesting extensions to more sophisticated constraints were studied, such as AllenMeter [97]. AllenMeter allows users to express contraints using temporal locations (instead of events) involving all the Allen relations [3].…”
This chapter reflects on about 10 years of research in AIassisted music composition, in particular during the Flow Machines project. We reflect on the motivations for such a project, its background, its main results and impact, both technological and musical, several years after its completion. We conclude with a proposal for new categories of "new", created by the many uses of AI techniques to generate novel material.
“…Some interesting extensions to more sophisticated constraints were studied, such as AllenMeter [97]. AllenMeter allows users to express contraints using temporal locations (instead of events) involving all the Allen relations [3].…”
This chapter reflects on about 10 years of research in AIassisted music composition, in particular during the Flow Machines project. We reflect on the motivations for such a project, its background, its main results and impact, both technological and musical, several years after its completion. We conclude with a proposal for new categories of "new", created by the many uses of AI techniques to generate novel material.
“…Furthermore, IncStrongClose, which processes key entries (staggered diagonal entries) first, tallies with how extremal values are first processed in constraint propagation [7]. Difference constraints can be generalised to Allen constraints [30] to express set theoretic properties, such as overlap. Solving Allen constraints is also polynomial, but each variable can be updated many times when calculating the fixpoint.…”
The octagon abstract domain is a widely used numeric abstract domain expressing relational information between variables whilst being both computationally efficient and simple to implement. Each element of the domain is a system of constraints where each constraint takes the restricted form ± x i ± x j ≤ c. A key family of operations for the octagon domain are closure algorithms, which check satisfiability and provide a normal form for octagonal constraint systems. We present new quadratic incremental algorithms for closure, strong closure and integer closure and proofs of their correctness. We highlight the benefits and measure the performance of these new algorithms.
“…At a different level, (Papadopoulos, Roy, and Pachet 2016) uses optimization techniques for automated composition in a given style. Finally, (Roy et al 2016) explores the Allen constraint, which can express time relations.…”
The CP conference is the annual international conference on constraint programming. It is concerned with all aspects of computing with constraints, including theory, algorithms, environments, languages, models, systems, and applications such as decision-making, resource allocation, scheduling, configuration, and planning. The CP community is very keen to ensure it remains open to interdisciplinary research at the intersection between constraint programming and related fields. Hence, in addition to the usual technical and application tracks, the CP 2016 conference featured thematic tracks: Computational Sustainability, CP and Biology, Preferences, Social Choice and Optimization, and Testing and Verification. In this overview, we highlight several remarkable papers that have been selected by the senior program committee and papers with the most innovative methods and techniques, and a very high potential for applications (in our opinion).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.