Description-meet compatible multiway dissimilarities

Characterization of Galois closed sets using multiway dissimilarities

We place ourselves in a so-called meet-closed description context; that is a context consisting of a finite nonempty entity set E whose elements are described in a complete meet-semilattice D, by means of a descriptor δ. Then we consider multiway quasi-ultrametric dissimilarities on E, a class of multiway dissimilarities that, with their relative k-balls, extend the fundamental in classificatio...

A Compatible Approach to Temporal Description Logics

Temporal description logics (TDLs) have been studied by many researchers (see e.g., [1, 10] for surveys and [4, 2, 15] for recent or important results). These TDLs are, however, not compatible in the following sense: these are not embeddable into the standard (non-temporal) description logics (DLs), and hence the existing algorithms for testing satisfiability in the standard DLs are not availab...

Theory-driven Logical Scaling: Conceptual Information Systems meet Description Logics

Recognizing Treelike k-Dissimilarities

A k-dissimilarity D on a finite set X, |X| ≥ k, is a map from the set of size k subsets of X to the real numbers. Such maps naturally arise from edge-weighted trees T with leaf-set X: Given a subset Y of X of size k, D(Y ) is defined to be the total length of the smallest subtree of T with leaf-set Y . In case k = 2, it is well-known that 2-dissimilarities arising in this way can be characteriz...

A UML-Compatible Formal Language for System Architecture Description