Abstract
In most styles of music, composition is governed by a set of rules. We demonstrate that approaching the automation and analysis of composition declaratively, by expressing these rules in a suitable logical language, powerful and expressive intelligent composition tools can easily be built. This paper describes the use of answer set programming to construct an automated system, named Anton, that can compose both melodic and harmonic music, diagnose errors in human compositions and serve as a computer-aided composition tool.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anders, T.: Composing Music by Composing Rules: Design and Usage of a Generic Music Constraint System. PhD thesis, Queen’s University, Belfast, Department of Music (2007)
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving, 1st edn. Cambridge University Press, Cambridge (2003)
Bel, B.: Migrating Musical Concepts: An Overview of the Bol Processor. Computer Music Journal 22(2), 56–64 (1998)
Boenn, G., Brain, M., De Vos, M., ffitch, J.: Automatic composition of melodic and harmonic music by answer set programming. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 160–174. Springer, Heidelberg (2008)
Boulanger, R. (ed.): The Csound Book: Tutorials in Software Synthesis and Sound Design. MIT Press, Cambridge (2000)
Brain, M., De Vos, M., Satoh, K.: The significance of memory costs in answer set solver implementation. Joural of Logic and Computation (2008); Advance Access Online
Brothwell, A., Ffitch, J.: An Automatic Blues Band. In: Proceedings of 6th International Linux Audio Conference, Kunsthochscule für Medien Köln, March 2008, pp. 12–17 (2008)
Chuang, J.: Mozart’s Musikalisches Würfelspiel (1995), http://sunsite.univie.ac.at/Mozart/dice/
Cope, D.: A Musical Learning Algorithm. Computer Music Journal 28(3), 12–27 (Fall 2006)
Fux, J.J.: The Study of Counterpoint from Johann Joseph Fux’s Gradus ad Parnassum. W.W. Norton (1965); orig 1725
Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-Driven Answer Set Solving. In: Proceeding of IJCAI 2007, pp. 386–392 (2007)
Laurson, M.: PWConstraints Reference Manual. IRCAM, Paris (1996)
Lierler, Y., Maratea, M.: Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 346–350. Springer, Heidelberg (2004)
Syrjänen, T., Niemelä, I.: The Smodels System. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, p. 434. Springer, Heidelberg (2001)
Syrjänen, T.: Lparse 1.0 User’s Manual. Helsinki University of Technology (2000)
Thakar, M.: Counterpoint. New Haven (1990)
Ward, J., Schlipf, S.: Answer Set Programming with Clause Learning. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS, vol. 2923, pp. 302–313. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boenn, G., Brain, M., De Vos, M., ffitch, J. (2009). ANTON: Composing Logic and Logic Composing. In: Erdem, E., Lin, F., Schaub, T. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2009. Lecture Notes in Computer Science(), vol 5753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04238-6_55
Download citation
DOI: https://doi.org/10.1007/978-3-642-04238-6_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04237-9
Online ISBN: 978-3-642-04238-6
eBook Packages: Computer ScienceComputer Science (R0)