Page  203 ï~~PREDIBASE-CONTROLLING SEMANTICS OF SYMBOLIC STRUCTURES IN MUSIC Oliver Zahorka MultiMedia Lab, Institut fir Informatik, Universitat Zurich, Winterthurerstrasse 190, CH-8057 Zurich, Switzerland zahorka@ifi.unizh.ch Abstract PrediBase is a database management system, capable of handling flexible and open semantic data structures. It was developed with the complexity of musical score notation in mind, as part of the RUBATO performance workstation. The high demands of the classical musical score relative to handling polymorphism and polysemy of data are satisfied by a unique design, developed according to perceptions of structuralist semiology and predicate logic. Moreover, the possibilities given by logical and geometric motivation allow for new ways to retrieve, inspect and relate the data at hand. 1 Introduction The representation and processing of musical score data is an often discussed issue in the field of computing musicology and algorithmic composition. Problems do not only arise when capturing music with a given set of predefined signs, but also when translating these signs into a machine readable and processible format. This is due to the context dependent semantic flexions and indeterminations inherent to most natural human sign systems: " In natural sign systems, signs coexisting on the same level represent objects living in completely different parameter spaces. " The number and type of parameters may change from instance to instance. * There are cases where no concrete or default value is available to be assigned to a certain parameter. EXAMPLE The notes of a piece, found on a page of music written in common notation, may be fully represented in the space of {onset, pitch, loudness, duration }, whereas the rests, for example, live in the sub-space of {onset, duration} and do not have loudness or pitch parameters. To cope with the above problems, a database management system must fulfill the following specifications: " The data structures must be flexible with respect to hierarchy and type, user configurational and expandable at run-time. " The assignment of meaning-i.e. the input of concrete values like strings and numbers-may be postponed, while the system remains operable. Common database management systems known until now do not allow for appropriate representation and manipulation of such complex sign systems (Vossen, G.). 2 PrediBase and the Predicate Calculus Theory By further study of the diversity of musical signs and connecting this with structuralist semiology, we introduced the concept of Predicates to our database management system, called PrediBase. The Predicates in PrediBase are an adapted and expanded version of the well-known structuralist sign model of Saussure, where sings are unities of signifiant-->signfif and the mediating signification (Saussure, F.). To be able to use such signs on a formal level-for the operations required in analysis of music, say-the traditional references to signifier (name) and signified (value), are enriched by the form resp. type of signification. IC M C PROC EED I N G S 199520 203

Page  204 ï~~FIGURE 1 The sign model according to Ferdinand de Saussure (1875-1913), as proposed in his "cours de linguistique generale" A signe consists of signifiant and signifie, which can not be disconnected from each other. Without a signifie, the signifiant remains mere form, whereas a sole signifie is an unnamed quantity. _______-______--_ An expression of the sign: acoustical image, string. Mechanism of connecting (arbitrary, motivated) the ~. Signification signifier to the signified, i.e. the semiosis of the sign. \ The mental concept or real world item, the sign stands \ \ for. 2.1 Signification and Form The signification is the process of connecting the two parts signifiant and signifie, i.e. the semiosis of the sign. In our specialized context, the signification tells first whether or not the value of a Predicate is a reference to another Predicate. If it is a reference, it gives further information about the kind of referenced Predicate at hand. Otherwise it tells what kind of value is to be expected for retrieval. In our model, the signification is represented by a Form of a certain type. Let us first explain how the Form works. The Form describes the structure of a Predicate and therefore also the admissible operations-in particular mathematical ones-on any type of Predicate. Intuitively, the Forms describe all possible instances of Predicates. According to the classical Aristotelian distinction of form and substance, the actual Predicate instances (of a particular Form) are called the substance (of this Form). FIGURE 2 The Form itself is a sign too, with its signifier considered unique among all named Forms. Although in most cases the signifier of a Predicate (substance) is equal to the signifier of its Form, this is no necessity; unnamed Forms may be used to gain freedom in signifier assignment of the substance. Signifier (name) of the Form. Convention how the signifier is used, what kind of sig'- r, f, M - U? nified is to be expected: the type of signification. Value is either a compound structure, like all the factors of a product, or a default value for new simple Predicate instances. 2.2 Simple and Compound Predicate Types In addition to the classical simple Predicates, there exist more complex composed ones, the compound Predicates. They are references to either simple Predicates or collections of compound Predicates again. Simple Predicates are those referring to a single value representing number or text information, or no value at all: Â~ (empty), a (a string), i (an integer), f(a floating number), q/(a boolean value). Compound Predicates are those which refer to one or more other Predicates, namely: Synonyms (the reference to any other Predicate: "Flute"--> "Flfite"), Product (a fixed list of Predicates, as in a parameter list: "Note"n{Onset, Pitch, Loudness, Duration }), Coproduct (choice of one from a given list of possible Predicates: "Accidental" U Sharp or Flat), Power Set (a list of variable length composed of equal Predicates: "SlurLegato"{ } {Note 1, Note2,..., Notek }). Now that we know all the components, let us give the recursive definitions of Form and Predicate: DEFINITION 1 Form(NAME, TYPE, VALUE) The Form is an arbitrary sign with a fixed signification paradigm, denoted by the Form's type. It represents the convention how Predicates are built in a certain environment. Since they reference other Forms, compound Forms are recursive by nature. 204 I0 CMC PROCEEDINGS 1995

Page  205 ï~~DEFINITION 2 FIGURE 3 Predicate(NAME, FORM, VALUE) The Predicate is an arbitrary or motivated sign built according to the convention of its Form. The signification paradigm is restricted to a single signification by assignment of a value. Within PrediBase, the Predicate is an object containing the signifier's string value and appropriate substance values, according to its referenced Form. NAME the signifier of the Predicate, normally identical to the signifier of its Form -IAsimple a computational value: (Â~, a, i,f, ') VALUE ~~reference to one Predicate: (->, u) L(compound - compoun reference to a list of Predicates: (n, { }) the common signifier used by the NAME Predicates of a Form simple a computational default value: (Â~, a, i,f, /) to one Form: (-4, { }) to a list of Forms: (7t, ) 2.3 Total Order of Predicates Any database management system must be able to store, retrieve and visualize data in a desired logical order. If the data at hand has no genuine order, artificial ordering by indexes, with its undesirable side effects, takes place. In PrediBase, all substance of simple or compound, arbitrary or motivated Predicates is canonically ordered, since Forms naturally define a unique linear order among all Predicates. DEFINITION 3 Simple Predicates are ordered according to the linear orders on their value domains (real numbers, strings). Products are ordered by the cartesian product of their factors. Coproducts are ordered by indexed disjoint union of the orders of the cofactors. Power sets are linearly ordered by their substance. For two non-empty sets A and B we define ("max" is only defined for non-empty differences!) A>B= (ADB) v (max (A-B) >max(B-A)). 3 The Paradigm of Logic and Geometric Motivation One of the difficult tasks in musicology is to transform the given symbolic structure of a musical piece into a derived symbolic structure, suitable to be processed by analytical algorithms. Assuming all relevant data is available as Predicate instances, we need tools to retrieve and relate this data in order to make new predicates. In other words, the application of operators produces motivated Predicates from a given set of arbitrary (or already motivated) Predicates. For this transformation, we introduce logical and geometric operators. Logical operators: negation, conjunction, disjunction, universal and existence quantifiers. IC M C P RO C EE D I N G S 19952 205

Page  206 ï~~" Geometric operators: projection and retract of products resp. restriction of coproducts and their canonical extension to power sets of products and coproducts, fiber products of Predicates. Observe, that all these operators act on the substances of Predicates. In general, before applying any other operator to a global substance, the substance must be restricted and projected onto a common Form since, by definition, all operators only operate on Predicates of one and the same Form and result always in Predicates of the original Type. In case of negation, conjunction and disjunction, the resulting Predicate is even of the original Form. Since we cannot predict what Forms and operators will be combined while using an actual PrediBase, it is essential to know that logical and geometric operators-no matter how they are applied-do not create new (unknown) types of Predicates. 3.1 Visualization Since we can not rely on any fixed record structures, an intelligible visualization of the Predicate substance stored in a PrediBase seems to be a difficult task. But the way how Forms define a canonical order among Predicates relieves us from imposing unnatural orders and eases visualization concepts. Although we dispose of approaches-mainly generalizations of the usual view of sounds within parameter frames, as they appear in sequencers, as well as the lexical search geometry in a dictionary-to visualize PrediBase substance in two dimensional views, we still are in need for the tools to intuitively navigate through multidimensional virtual data spaces. Some approaches are seen in the field of Virtual Reality-for example an Audio Browser, shown at the ICMC94 (Whitehead, J. F.), where the user has the impression of moving around inside a database of sound objects, laid out in a three-dimensional space. 4 Summary Designed with the richness and complexity of classical musical scores in mind, PrediBase allows for records with variable dimensions, a priori unknown values and semantic depth. Data-i.e. Predicate instances-is always kept in a canonical linear order determined by the Predicates' respective Forms. This order defines natural ways of navigation through and visualization of the data. Predicates can be related, interconnected and retrieved as desired through logical and geometric operators. Interestingly enough, the results of the application of these operators are Predicates again, which may undergo the same processes. Currently, a PrediBase prototype-implemented as a hierarchy of Objective-C classes under the NEXTSTEP development environment-is used as the underlying database system for the representation and retrieval of symbolic score data in the RUBATO performance workstation (Mazzola G. & Zahorka 0.). 5 Acknowledgments I would like to thank Guerino Mazzola, without whom none of this work would have been possible. Financially, this research was made possible by a grant from the Swiss National Science Foundation. 6 References Mazzola, G. & Zahorka O. The RUBATO Performance Workstation on NeXTSTEP, In Proceedings of the 1994 International Computer Music Conference, 102-108, Arhus 1994. Whitehead, J. F. The Audio Browser: An Audio Database Navigation Tool in a Virtual Environment, In Proceedings of the 1994 International Computer Music Conference, 280-283..Arhus 1994. Saussure, F. de. Cours de linguistique g~n~rale. Ed. Charles Bally, Albert Sechehaye. Paris 1916. Vossen, G. Datenmodelle, Datenbanksprachen und Datenbank-Management-Systeme. Addison-Wesley, Bonn 1994. 206 I C M C PROCEEDINGS 1995