Representing Trees with Constraints
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and how we can represent the set of trees belonging to that class using constraints. The method enables the specification of a set of trees without having to generate all of the members of the set. This allows us to reason about sets of trees that would normally be too large to use. We present this research in the context of a system to generate expressive musical performances and, in particular, how this method can be used to represent musical structure.
Unable to display preview. Download preview PDF.
- Cayley A.: On the Analytical Forms Called Trees. Coll. Math. Papers, Vol. 4. Cambridge University Press (1891)Google Scholar
- Henz M., Lauer S. and Zimmermann D.: COMPOzE-Intention-based Music Composition through Constraint Programming. Proceedings of the 8th IEEE International Conference on Tools with Artificial Intelligence, IEEE Computer Society Press (1996)Google Scholar
- Lerdahl F. and Jackendoff R.: A Generative Theory of Tonal Music. MIT Press (1983)Google Scholar
- Sloane N.J.A.: The On-Line Encyclopedia of Integer Sequences. Published electronically at http://www.research.att.com/~njas/sequences/ (2000)
- Tsuchida K., Adachi Y., Imaki T. and Yaku T.: Tree Drawing Using Constraint Logic Programming. Proceedings of the 14th International Conference of Logic Programming, MIT Press (1997)Google Scholar
- Van Hentenryck P.: Constraint Satisfaction in Logic Programming. Logic Programming Series, MIT Press (1989)Google Scholar