Gelisp: A Library to Represent Musical CSPs and Search Strategies
Mauricio Toro, Camilo Rueda, Carlos Ag\'on, G\'erard Assayag
TL;DR
Gelisp is a new library that simplifies representing musical constraint satisfaction problems and search strategies, offering command-line and graphical interfaces, demonstrated through music generation and series solutions.
Contribution
Introduces Gelisp, a novel library with dual interfaces for representing and solving musical CSPs, enhancing usability and application scope.
Findings
Successfully solved a music generation problem by Michael Jarrell
Found solutions for the All-interval series
Demonstrated intuitive use of Gelisp for musical CSPs
Abstract
In this paper we present Gelisp, a new library to represent musical Constraint Satisfaction Problems and search strategies intuitively. Gelisp has two interfaces, a command-line one for Common Lisp and a graphical one for OpenMusic. Using Gelisp, we solved a problem of automatic music generation proposed by composer Michael Jarrell and we found solutions for the All-interval series.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMusic and Audio Processing · Music Technology and Sound Studies · Algorithms and Data Compression