### Résumé

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 e±cient 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.

langue originale | Anglais |
---|---|

Pages (de - à) | 58-84 |

Nombre de pages | 27 |

journal | Journal on Data Semantics |

Volume | 3360 |

Etat de la publication | Publié - 2004 |

## Empreinte digitale Examiner les sujets de recherche de « Compound Term Composition Algebra: The Semantics ». Ensemble, ils forment une empreinte digitale unique.

## Contient cette citation

Tzitzikas, Y., Analti, A., & Spyratos, N. (2004). Compound Term Composition Algebra: The Semantics.

*Journal on Data Semantics*,*3360*, 58-84.