Constraint Programming Approach to the Problem of Generating Milton Babbitt's All-Partition Arrays

Tsubasa Tanaka 1 Brian Bemman 2 David Meredith 2
1 Repmus - Représentations musicales
STMS - Sciences et Technologies de la Musique et du Son
2 AAU - Aalborg University [Denmark]
Abstract : Milton Babbitt (1916–2011) was a composer of twelve-tone serial music noted for creating the all-partition array. One part of the problem in generating an all-partition array requires finding a covering of a pitch-class matrix by a collection of sets, each forming a region containing 12 distinct elements and corresponding to a distinct integer partition of 12. Constraint programming (CP) is a tool for solving such combinatorial and constraint satisfaction problems. In this paper, we use CP for the first time to formalize this problem in generating an all-partition array. Solving the whole of this problem is difficult and few known solutions exist. Therefore, we propose solving two sub-problems and joining these to form a complete solution. We conclude by presenting a solution found using this method. Our solution is the first we are aware of to be discovered automatically using a computer and differs from those found by composers.
Keywords : Milton Babbitt All-partition array Computational musicology Constraint programming
Type de document :
Communication dans un congrès
The 22nd International Conference on Principles and Practice of Constraint Programming, Sep 2016, Toulouse, France. 2016, Principles and Practice of Constraint Programming 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings. 〈10.1007/978-3-319-44953-1_50〉
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger
https://hal.archives-ouvertes.fr/hal-01467879
Contributeur : Tsubasa Tanaka <>
Soumis le : mardi 14 février 2017 - 18:11:21
Dernière modification le : mardi 11 décembre 2018 - 01:25:29
Document(s) archivé(s) le : lundi 15 mai 2017 - 17:35:06

Fichier

CP2016_final.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

IRCAM | UPMC | STMS | SORBONNE-UNIVERSITE

Citation

Tsubasa Tanaka, Brian Bemman, David Meredith. Constraint Programming Approach to the Problem of Generating Milton Babbitt's All-Partition Arrays. The 22nd International Conference on Principles and Practice of Constraint Programming, Sep 2016, Toulouse, France. 2016, Principles and Practice of Constraint Programming 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings. 〈10.1007/978-3-319-44953-1_50〉. 〈hal-01467879〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

169

Téléchargements de fichiers

155

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD