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

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9892)

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

Babbitt All-partition array Computational musicology Constraint programming 

Notes

Acknowledgments

The work of Tsubasa Tanaka reported in this paper was supported by JSPS Postdoctoral Fellowships for Research Abroad. The work of Brian Bemman and David Meredith was carried out as part of the project Lrn2Cre8, which acknowledges the financial support of the Future and Emerging Technologies (FET) programme within the Seventh Framework Programme for Research of the European Commission, under FET grant number 610859.

References

  1. 1.
    Babbitt, M.: Since Schoenberg. Perspect. New Music 12(1/2), 3–28 (1973)CrossRefGoogle Scholar
  2. 2.
    Mead, A.: An Introduction to the Music of Milton Babbitt. Princeton University Press, Princeton (1994)CrossRefGoogle Scholar
  3. 3.
    Anders, T., Anagnostopoulou, C., Alcorn, M.: Strasheela: design and usage of a music composition environment based on the Oz programming model. In: Van Roy, P. (ed.) MOZ 2004. LNCS, vol. 3389, pp. 277–291. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Laurson, M., Kuuskankare, M.: A constraint based approach to musical textures and instrumental writing. In: Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, Musical Constraints Workshop (2001)Google Scholar
  5. 5.
    Carpentier, G., Assayag, G., Saint-James, E.: Solving the musical orchestration problem using multiobjective constrained optimization with a genetic local search approach. Heuristics 16(5), 681–714 (2010). SpringerCrossRefMATHGoogle Scholar
  6. 6.
    Chemillier, M., Truchet, C.: Two musical CSPs. In: Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, Musical Constraints Workshop (2001)Google Scholar
  7. 7.
    Puget, J.F., Régin, J.C.: Solving the All Interval Problem. https://ianm.host.cs.st-andrews.ac.uk/CSPLib/prob/prob007/puget.pdf
  8. 8.
    Bemman, B., Meredith, D.: Generating Milton Babbitt’s all-partition arrays. J. New Music Res. 45(2), (2016a). http://www.tandfonline.com/doi/full/10.1080/09298215.2016.1172646
  9. 9.
    Starr, D., Morris, R.: A general theory of combinatoriality and the aggregate, part 1. Perspect. New Music 16(1), 3–35 (1977)CrossRefGoogle Scholar
  10. 10.
    Starr, D., Morris, R.: A general theory of combinatoriality and the aggregate, part 2. Perspect. New Music 16(2), 50–84 (1978)CrossRefGoogle Scholar
  11. 11.
    Bazelow, A.R., Brickle, F.: A combinatorial problem in music theory: Babbitt’s partition problem (I). Ann. N. Y. Acad. Sci. 319(1), 47–63 (1979)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
  13. 13.
    Naoyuki, T., Mutsunori, B.: Sugar: A CSP to SAT translator based on order encoding. In: Proceedings of the 2nd International CSP Solver Competition, pp. 65–69 (2008)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.STMS Lab: IRCAM, CNRS, UPMCParisFrance
  2. 2.Aalborg UniversityAalborgDenmark

Personalised recommendations