Skip to main content

Representing Trees with Constraints

  • Conference paper
  • First Online:
Computational Logic — CL 2000 (CL 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1861))

Included in the following conference series:

Abstract

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.

Ben Curry is supported by UK EPSRC postgraduate studentship 97305827

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cayley A.: On the Analytical Forms Called Trees. Coll. Math. Papers, Vol. 4. Cambridge University Press (1891)

    Google Scholar 

  2. 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 

  3. Lerdahl F. and Jackendoff R.: A Generative Theory of Tonal Music. MIT Press (1983)

    Google Scholar 

  4. Sloane N.J.A.: The On-Line Encyclopedia of Integer Sequences. Published electronically at http://www.research.att.com/~njas/sequences/ (2000)

  5. 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 

  6. Van Hentenryck P.: Constraint Satisfaction in Logic Programming. Logic Programming Series, MIT Press (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Curry, B., Wiggins, G.A., Hayes, G. (2000). Representing Trees with Constraints. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-44957-4_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67797-0

  • Online ISBN: 978-3-540-44957-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics