This chapter discusses implemented description logic systems that have played or play an important role in the field. It first presents several earlier systems that, although not based on description logics, have provided important ideas. These systems include Kl-One, Krypton, Nikl, and Kandor. Then, successor systems are described by classifying them along the characteristics discussed in the ...

Iconography is the domain of understanding the meaning of historical visual artworks. A formalization of iconographic knowledge can provide a basis for a semi-automatic description of what the content shown on a historical image means without the need for a domain expert. Semantic Web standards can be applied for an iconographic knowledge representation using multiple levels of expressiveness t...

Broad Research Program My philosophical research aims to develop a general theory of pragmatic embodied epistemology. Pragmatic embodied epistemology is the philosophical investigation of the possibility conditions and normative principles for embodied agents to represent their world and to utilize the representations in their interactions with the world. Pragmatic embodied epistemology differs...

This document describes the research I have done since October 1995 for my PhD thesis at the Dept. of Computer Science, University of Sheffield, U.K., which I expect to complete by October/November 1999. My thesis research has involved two generic fields of machine learning: dimensionality reduction and sequential data reconstruction, which I have approached from the common point of view of lat...

I study algorithms in graphs, maily applied to the spreading of the information in telecommunications networks. I study the structure of graphs and some routing problems through graph searching games. In these games, a team of searchers aims at capturing a fugitive in a graph. The mobile agents follow the paths in the graph with bounded or unbounded speed and satisfying some constraints. The (N...

My primary and current research work is in the general spirit of algebras of logic, lattice theory, hyper structures and applications. A partially ordered set, or poset for short is a pair (P, ≤) where P is a set and ≤ a partial order on P. A poset (P, ≤) is called a lattice if every pair x, y ∈ P has a least upper bound x ∨ y and a greatest lowest bound x ∧ y in P. A lattice is bounded if it h...