Compound term composition algebra: the semantics

Authors:
Yannis Tzitzikas;Anastasia Analyti;Nicolas Spyratos
Affiliations:
Institut d'Informatique, F.U.N.D.P. (University of Namur), Belgium;Institute of Computer Science, FORTH, Heraklion, Greece;Laboratoire de Recherche en Informatique, Universite de Paris-Sud, France
Venue:
Journal on Data Semantics II
Year:
2005

Citing 3
Cited 9

Classification of reusable modules

Software reusability: vol. 1, concepts and models
Implementing faceted classification for software reuse

Communications of the ACM - Special issue on software engineering
Reasoning in description logics

Principles of knowledge representation

Mining the meaningful term conjunctions from materialised faceted taxonomies: algorithms and complexity

Knowledge and Information Systems
Logic Programming Representation of the Compound Term Composition Algebra

Fundamenta Informaticae
An algebra for specifying valid compound terms in faceted taxonomies

Data & Knowledge Engineering
Schema polynomials and applications

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
An algebraic method for compressing symbolic data tables

Intelligent Data Analysis - Analysis of Symbolic and Spatial Data
Specifying Valid Compound Terms in Interrelated Faceted Taxonomies

ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
Revising faceted taxonomies and CTCA expressions

SETN'06 Proceedings of the 4th Helenic conference on Advances in Artificial Intelligence
Logic Programming Representation of the Compound Term Composition Algebra

Fundamenta Informaticae
A survey of faceted search

Journal of Web Engineering

Quantified Score

Hi-index	0.00

Visualization

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.