Torsten Anders

Torsten Anders
Aiva (http://aiva.ai)

PhD

About

32
Publications
23,245
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
188
Citations
Citations since 2016
9 Research Items
76 Citations
2016201720182019202020212022051015
2016201720182019202020212022051015
2016201720182019202020212022051015
2016201720182019202020212022051015
Additional affiliations
September 2010 - present
University of Bedfordshire
Position
  • Lecturer
August 2010 - present
University of Bedfordshire
Position
  • Senior Lecturer in Music Technology
Description
  • Course Leader for the Music Technology courses
August 2007 - July 2010
University of Plymouth

Publications

Publications (32)
Preprint
Full-text available
This chapter introduces the use of Constraint Programming for modelling the algorithmic generation of harmonic progressions for composition. Constraint Programming (CP) is a paradigm based on explicitly encoded compositional rules. The paradigm allows to directly implement traditional rules, such as rules found in music theory textbooks, as well as...
Article
Full-text available
We describe a method for automatically extracting symbolic compositional rules from music corpora. Resulting rules are expressed by a combination of logic and numeric relations, and they can therefore be studied by humans. These rules can also be used for algorithmic composition, where they can be combined with each other and with manually programm...
Preprint
Full-text available
We describe a method to automatically extract symbolic compositional rules from music corpora that can be combined with each other and manually programmed rules for algorithmic composition, and some preliminary results of applying that method. As machine learning technique we chose genetic programming, because it is capable of learning formula cons...
Chapter
Full-text available
This chapter surveys music constraint programming systems, and how composers have used them. The chapter motivates why and explains how users of such systems describe intended musical results with constraints. This approach to algorithmic composition is similar to the way declarative and modular compositional rules have successfully been used in mu...
Data
Slides for 2007 classes – session 3
Data
Slides for 2007 classes – session 1
Data
Slides for 2007 classes – session 2
Data
Slides for 2007 classes – session 4
Article
Full-text available
This paper presents software suitable for undergraduate students to implement computer programs that compose music. The software offers a low floor (students easily get started) but also a high ceiling (complex compositional theories can be modelled). Our students are particularly interested in tonal music: such aesthetic preferences are supported,...
Conference Paper
Full-text available
This paper presents a computational model of durational accents, where users control the metric (or more generally temporal) position of accents in the generated music. Several examples demonstrate the flexibility of the model in different rhythmic situations, including regular metric accents, accents shifted with respect to the meter, and irregula...
Article
Full-text available
Draft available for download. Constraint programming is well suited for the computational modeling of music theories and composition: its declarative and modular approach shares similarities with the way music theory is traditionally expressed, namely by a set of rules which describe the intended result. Various music theory disciplines have been...
Article
Full-text available
Draft available at http://cmr.soc.plymouth.ac.uk/tanders/publications/Anders-Microtonal-PNM2011/MicrotonalHarmony.html That draft makes the research reproducible by presenting the full source code for all its examples. This paper presents a computational model for microtonal music theories and composition based on the constraint programming parad...
Chapter
Full-text available
Draft available for download.
Article
Full-text available
Modeling music theories with computer programs has attracted composers and scholars for a long time. On the one hand, the resulting programs can serve as algorithmic composition tools. On the other hand, such an approach leads to a better understanding of existing as well as newly developed theories, which in turn can lead to a better understanding...
Data
Full-text available
This paper presents a formal model of Schoenberg’s guidelines for convincing chord root progressions. This model has been implemented as part of a system that models a considerable part of Schoenberg’s Theory of Harmony. This system implements Schoenberg’s theory in a modular way: besides generating four-voice homophonic chord progressions, it can...
Article
Full-text available
Draft available for download. Computer-aided composition (CAC) is situated somewhere in the middle between manual composition, and automated composition that is performed autonomously by a computer program. Computers cannot make aesthetic decisions on their own, they only follow orders. Aesthetic decisions are made by composers, both via the desig...
Conference Paper
Full-text available
This paper presents a model of musical motifs for composition. It defines the relation between a motif’s music representation, its distinctive features, and how these features may be varied. Motifs can also depend on non-motivic musical conditions (e.g., harmonic, melodic, or rhythmic rules). The model was implemented as a constraint satisfaction p...
Article
Full-text available
This paper presents a formal model of Schoenberg's guidelines for convincing chord root progressions. This model has been implemented as part of a system that models a considerable part of Schoenberg's Theory of Harmony. This system implements Schoenberg's the-ory in a modular way: besides generating four-voice homophonic chord progressions, it can...
Conference Paper
Full-text available
Brain-Computer Music Interface (BCMI) is a new research area that is emerging at the cross roads of neurobiology, engineering sciences and music. This research involves three major challenging problems: the extraction of meaningful control information from signals emanating directly from the brain, the design of generative music techniques that res...
Conference Paper
Full-text available
Generating technical exercises for various levels of play- ing ability is important for any instrument method book. Writing exercises by hand can be quite tedious, and severely limits the number of exercises which could be created. This is particularly apparent when we consider computer music tutoring systems, which could benefit from a library of...
Conference Paper
Full-text available
This paper studies how constraints are applied to the score in a musical constraint satisfaction problem (CSP). How can we control which variable sets in the score are affected by a given constraint? Our overall objective is to produce a highly generic music constraint system, where users can define a wide range of musical CSPs, including rhythmic,...
Conference Paper
Full-text available
This paper proposes an approach for constraint-based algorithmic composition in realtime. To our knowledge, constraint programming - which performs a search - has not been used for music composition in realtime before. The main contribution of this paper is a meta-solver with a timeout. We decompose the music creation process into one sub-constrain...
Thesis
Full-text available
This research presents the design, usage, and evaluation of a highly generic music constraint system called Strasheela. Strasheela simplifies the definition of musical constraint satisfaction problems (CSP) by predefining building blocks required for such problems. At the same time, Strasheela preserves a high degree of generality and is reasonably...
Conference Paper
Full-text available
Strasheela provides a means for the composer to create a symbolic score by formally describing it in a rule-based way. The environment defines a rich music representation for complex polyphonic scores. Strasheela enables the user to define expressive compositional rules and then to apply them to the score. Compositional rules can restrict many aspe...
Conference Paper
Full-text available
This article proposes an efficient search strategy for constraint based computer assisted composition. The strategy uses the emphpropagate and distribute technique and always proceeds in score-time, even if the rhythmic structure of the score is not known before search.
Conference Paper
Full-text available
Constraints programming allows the composer to synthesize a score by describing it. Arno is a program for computer assisted composition which extends Common Music (CM) by means of constraints programming using Screamer. In Arno parameters of CM elements in a CM container can be declared nondeterministically using finite domains --- instead of singl...

Questions

Question (1)
Question
As you know, constraint programming is build into several languages, notably several languages in the Prolog family, but there are also others (I have been using Oz for many years). These languages are particular "high-level" (e.g., programming paradigms with high degree of abstraction), which is great for modelling CSP at a high level. On the other hand, these languages are not mainstream: they have their communities, tools etc., but compared with mainstream languages their programming environments are lacking in various ways.
In addition, there are several libraries that add constraint programming support. Often these are C or C++ libraries, others are for Java etc . Such mainstream languages have huge communities, which greatly helps their development tools and libraries. Languages close to the metal can also be suitable for optimising search in CP. For the modelling of complex CSP however, such "low-level" languages add a certain overhead.
For my purposes (focus on modelling of complex CSPs) I would ideally like some mainstream language that is at the same time rather high level. So, I am currently looking at the constraint programming libraries for Python.
Anyway -- which programming systems are you using and why?

Network

Cited By