Pierre Roy

Followers

Following

Public Views

Prof Eduardo R. Miranda

Plymouth University

Dorien Herremans

Singapore University of Technology and Design (SUTD)

Elaine Chew

Ramon Lopez De Mantaras

CSIC (Consejo Superior de Investigaciones Científicas-Spanish National Research Council)

Philippe Pasquier

Simon Fraser University

Geraint Wiggins

Vrije Universiteit Brussel

Moray Allan

Torsten Anders

University of Bedfordshire

Matt Cranitch

Derry Fitzgerald

Interests

Uploads

Papers by Pierre Roy

Musical Harmonization with Constraints: A Survey

Constraints - An International Journal, 2001

We survey works on the musical problem of automatic harmonization. This problem, which consists i... more We survey works on the musical problem of automatic harmonization. This problem, which consists in creating musical scores which satisfy given rules of harmony, has been the object of numerous studies, most of them using constraint techniques in one way or another. We outline the main results obtained and the current status of this category of problems.

Download

Automatic Generation of Music Programs

Advances in networking and transmission of digital multimedia data bring huge catalogues of multi... more Advances in networking and transmission of digital multimedia data bring huge catalogues of multimedia items to users. In the case of music, accessing these catalogues raises a problem for users and content providers, which we define as the music selection problem. From the user point of view, the goals are to match preferences, as well as provide them with new music. From the content provider viewpoint, the goal is to exploit the catalogue in an optimal fashion. We propose a novel approach to music selection, based on computing coherent sequences of music titles, and show that this amounts to solving a combinatorial pattern generation problem. We propose a language to specify these sequences and a solving technique based on global constraints.

Download

Using Symmetry of Global Constraints to Speed up the Resolution of Constraint Satisfaction Problems

Symmetry in constraint satisfaction problems (CSP) can be used to either compute only a subset of... more Symmetry in constraint satisfaction problems (CSP) can be used to either compute only a subset of the total solution set, or to prune branches of the search tree. However, detecting symmetry in general is a difficult task. In this paper, we address the problem of detecting and exploiting a particular class of symmetry called intensional permutability, which is based on the notion of interchangeability between variables and can be detected with a very small overhead. This kind of symmetry is detected by collecting information on symmetrical properties of individual constraints. This method works particularly well on problems designed using global constraints. We show how intensional permutability dramatically reduces the search tree for some problems. We propose a simple method to exploit it, which can be implemented as a lightweight extension to most resolution algorithms based on backtracking. We illustrate the method on several symmetrical problems, such as a classical layout problem and the pigeonhole problem, stated with a global constraint. Finally, we extend the method to symmetries involving groups of variables.

A Combinatorial Approach to Content-Based Music Selection

Advances in networking and transmission of digital multimedia data will soon bring huge catalogue... more Advances in networking and transmission of digital multimedia data will soon bring huge catalogues of music to users. Accessing these catalogues raises a problem for users and content providers, that we define as the music selection problem. We introduce three main goals to be satisfied in music selection: match user preferences, provide users with new music, and exploit the catalogue in an optimal fashion. We propose a novel approach to music selection, based on computing coherent sequences of music titles, and show that this amounts to solving a combinatorial pattern generation problem. We propose constraint satisfaction techniques to solve it. The resulting system is an enabling technology to build better music delivery services

Download

Reifying Constraint Satisfaction in Smalltalk

Journal of Object-oriented Programming, 1997

We discuss the problem of the representation of constraints in an object-oriented programming lan... more We discuss the problem of the representation of constraints in an object-oriented programming language. We focus on a particular topic - constraint satisfaction for finite domains - and propose a class library that integrates constraints within an object-oriented language. The library is based on the systematic reification of variables, constraints, problems and algorithms. The library is implemented in Smalltalk, and

A Combinatorial Approach to Content-Based Music Selection

IEEE Multimedia, 2000

Advances in networking and transmission of digital multimedia data will bring soon huge catalogue... more Advances in networking and transmission of digital multimedia data will bring soon huge catalogues of music to users. Accessing these catalogues raises a problem for users and content providers, that we define as the music selection problem. We introduce three main goals to be satisfied in music selection: match user preferences, provide users with new music, and exploit the catalogue in an optimal fashion. We propose a novel approach to music selection, based on computing coherent sequences of music titles, and show that this amounts to solving a combinatorial pattern generation problem. We propose constraint satisfaction techniques to solve it. The resulting system is an enabling technology to build better music delivery services.

Download

Musical Harmonization with Constraints: A Survey

Constraints - An International Journal, 2001

Download

Automatic Generation of Music Programs

Download

Using Symmetry of Global Constraints to Speed up the Resolution of Constraint Satisfaction Problems