Skip to main content

Compound Term Composition Algebra: The Semantics

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((JODS,volume 3360))

Abstract

The Compound Term Composition Algebra (CTCA) is an algebra with four algebraic operators, whose composition can be used to specify the meaningful (valid) compound terms (conjunctions of terms) in a given faceted taxonomy in an efficient and flexible manner. The “positive” operations allow the derivation of valid compound terms through the declaration of a small set of valid compound terms. The “negative” operations allow the derivation of valid compound terms through the declaration of a small set of invalid compound terms. In this paper, we formally define the model-theoretic semantics of the operations and the closed-world assumptions adopted in each operation. We prove that CTCA is monotonic with respect to both valid and invalid compound terms, meaning that the valid and invalid compound terms of a subexpression are not invalidated by a larger expression. We show that CTCA cannot be directly represented in Description Logics. However, we show how we could design a metasystem on top of Description Logics in order to implement this algebra.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. XFML: eXchangeable Faceted Metadata Language., http://www.xfml.org

  2. XFML+CAMEL:Compound term composition Algebraically-Motivated Expression Language, http://www.csi.forth.gr/markup/xfml+camel

  3. Bock, H.H., Diday, E.: Analysis of Symbolic Data. Springer, Heidelberg (2000) ISBN: 3-540-66619-2

    Google Scholar 

  4. Diday, E.: An Introduction to Symbolic Data Analysis and the Sodas Software. Journal of Symbolic Data Analysis 0(0) (2002) ISSN 1723-5081

    Google Scholar 

  5. Donini, F.M., Lenzerini, M., Nardi, D., Schaerf, A.: Reasoning in Description Logics. In: Brewka, G. (ed.) Principles of Knowledge Representation, vol. 1, pp. 191–236. CSLI Publications (1996)

    Google Scholar 

  6. Duncan, E.B.: A Faceted Approach to Hypertext. In: McAleese, R. (ed.) HYPERTEXT: theory into practice, BSP, pp. 157–163 (1989)

    Google Scholar 

  7. Lindsay, P.H., Norman, D.A.: Human Information Processing. Academic press, New York (1977)

    Google Scholar 

  8. Maple, A.: Faceted Access: A Review of the Literature (1995), http://theme.music.indiana.edu/techs/mla/facacc.rev

  9. Prieto-Diaz, R.: Classification of Reusable Modules. In: Software Reusability, vol. I(4), pp. 99–123. ACM press, New York (1989)

    Google Scholar 

  10. Prieto-Diaz, R.: Implementing Faceted Classification for Software Reuse. Communications of the ACM 34(5), 88–97 (1991)

    Article  Google Scholar 

  11. Priss, U., Jacob, E.: Utilizing Faceted Structures for Information Systems Design. In: Proceedings of the ASIS Annual Conf. on Knowledge: Creation, Organization, and Use (ASIS 1999) (October 1999)

    Google Scholar 

  12. Ranganathan, S.R.: The Colon Classification. In: Artandi, S. (ed.) The Rutgers Series on Systems for the Intellectual Organization of Information. Graduate School of Library Science, vol. IV, Rutgers University, New Brunswick (1965)

    Google Scholar 

  13. Tzitzikas, Y., Analyti, A., Spyratos, N., Constantopoulos, P.: An Algebraic Approach for Specifying Compound Terms in Faceted Taxonomies. In: Information Modelling and Knowledge Bases XV, 13th European-Japanese Conference on Information Modelling and Knowledge Bases, EJC 2003, pp. 67–87. IOS Press, Amsterdam (2004)

    Google Scholar 

  14. Tzitzikas, Y., Launonen, R., Hakkarainen, M., Kohonen, P., Leppanen, T., Simpanen, E., Tornroos, H., Uusitalo, P., Vanska, P.: FASTAXON: A system for FAST (and Faceted) TAXONomy design. In: Procs. of 23th Int. Conf. on Conceptual Modeling, ER 2004, Shanghai, China (November 2004) (an on-line demo is available at http://fastaxon.erve.vtt.fi/ )

  15. Tzitzikas, Y.: An Algebraic Method for Compressing Very Large Symbolic Data Tables. In: Procs. of the Workshop on Symbolic and Spatial Data Analysis of ECML/PKDD 2004, Pisa, Italy (September 2004)

    Google Scholar 

  16. Tzitzikas, Y., Analyti, A.: Mining the Meaningful Compound Terms from Materialized Faceted Taxonomies. In: Procs. of the 3rd Intern. Conference on Ontologies, Databases and Applications of Semantics, ODBASE 2004, Larnaca, Cyprus, October 2004, pp. 873–890 (2004)

    Google Scholar 

  17. Tzitzikas, Y.T.: Collaborative Ontology-based Information Indexing and Retrieval. PhD thesis, Department of Computer Science - University of Crete (September 2002)

    Google Scholar 

  18. Vickery, B.C.: Knowledge Representation: A Brief Review. Journal of Documentation 42(3), 145–159 (1986)

    Article  Google Scholar 

  19. Woods, W.A.: Understanding Subsumption and Taxonomy. In: Principles of Semantic Networks, vol. 1, Morgan Kaufmann Publishers, San Francisco (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Tzitzikas, Y., Analyti, A., Spyratos, N. (2005). Compound Term Composition Algebra: The Semantics. In: Spaccapietra, S., et al. Journal on Data Semantics II. Lecture Notes in Computer Science, vol 3360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30567-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30567-5_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24208-6

  • Online ISBN: 978-3-540-30567-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics