Skip to main content
SpringerLink
Log in

Revising Faceted Taxonomies and CTCA Expressions

  • Conference paper
Advances in Artificial Intelligence (SETN 2006)

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

Included in the following conference series:

Abstract

A faceted taxonomy is a set of taxonomies each describing the application domain from a different (preferably orthogonal) point of view. CTCA is an algebra that allows specifying the set of meaningful compound terms (meaningful conjunctions of terms) over a faceted taxonomy in a flexible and efficient manner. However, taxonomy updates may turn a CTCA expression e ill-formed and may turn the compound terms specified by e to no longer reflect the domain knowledge originally expressed in e. This paper shows how we can revise e after a taxonomy update and reach an expression e′ that is both well-formed and whose semantics (compound terms defined) is as close as possible to the semantics of the original expression e before the update.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Tzitzikas, Y.: Updates and Revision in Faceted Taxonomies and CTCA Expressions. Technical Report 2005-11-18, TR 364, Institute of Computer Science-FORTH (November 2005)

    Google Scholar 

  2. Tzitzikas, Y., Launonen, R., Hakkarainen, M., Korhonen, P., Leppänen, T., Simpanen, E., Törnroos, H., Uusitalo, P., Vänskä, P.: FASTAXON: A system for FAST (and faceted) tAXONomy design. In: Atzeni, P., Chu, W., Lu, H., Zhou, S., Ling, T.-W. (eds.) ER 2004. LNCS, vol. 3288, pp. 841–843. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Tzitzikas, Y., Analyti, A., Spyratos, N.: Compound Term Composition Algebra: The Semantics. LNCS Journal on Data Semantics 2, 58–84 (2005)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Crete, Greece

    Yannis Tzitzikas

  2. Institute of Computer Science, FORTH-ICS, Greece

    Yannis Tzitzikas

Authors
  1. Yannis Tzitzikas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department of University of Crete, Greece

    Grigoris Antoniou

  2. Institute of Computer Science, Foundation for Research & Technology – Hellas (FORTH), Vassilika Vouton, P.O. Box 1385, 71110, Heraklion, Greece

    George Potamias

  3. Institute of Informatics and Telecommunications, NCSR "Demokritos", 15310 A., Paraskevi Attikis, Greece

    Costas Spyropoulos

  4. Institute of Computer Science, FO.R.T.H., Vassilika Vouton, P.O. Box 1385, GR 71110, Heraklion, Greece

    Dimitris Plexousakis

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tzitzikas, Y. (2006). Revising Faceted Taxonomies and CTCA Expressions. In: Antoniou, G., Potamias, G., Spyropoulos, C., Plexousakis, D. (eds) Advances in Artificial Intelligence. SETN 2006. Lecture Notes in Computer Science(), vol 3955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752912_78

Download citation

  • DOI: https://doi.org/10.1007/11752912_78

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34117-8

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation