News & Events


Senior Lecturer RACHARAK, Computing Science Research Area, received Dissertation Award in National Research Awards 2023 from NRCT

Senior Lecturer RACHARAK, Teeradaj, Computing Science Research Area, received Dissertation Award in National Research Awards 2023 from National Research Council of Thailand (NRCT).
This thesis was presented by him as his dissertation under the supervision of Prof. Satoshi Tojo in 2018 while he was a doctoral student at JAIST.

NRCT supports and honors Thai researchers who contribute to advancement of science and social scientific research that can benefit the public. NRCT has approved 165 awards of the year 2023, including 10 outstanding researcher awards, 57 research awards, 43 dissertation awards, and 55 invention awards. The honor award was dedicated to Senior Lecturer Racharak at the prestigious Thailand Inventors' Day event of the year 2023 (February 2 - 6, 2023).

■Date Awarded
February 2, 2023

Concept Similarity in Description Logics: Computations and Applications

Racharak, Teeradaj

Concept similarity measure, as investigated in this dissertation, aims at identifying a degree of commonality of two given concepts and is often regarded as a generalization of the classical reasoning problem of equivalence. That is, any two concepts are equivalent if and only if their similarity degree is one. We formally investigate this notion in Description Logics (DLs). Its results provide a basis for computational methods of identifying the commonalities and the discrepancies between two concepts. Our methods of concept similarity measure are proven to be tractable. To this end, they are thereby restricted to the DLs which do not provide all Boolean operators such as FL0 and ELH to avoid inheriting NP-hardness from propositional logic.

Similarity judgment used by human beings often involve preferences and needs in practice. More specifically, when two concepts are not logically equivalent or totally similar, they may rely on subjective factors e.g. the agent's preferences. Here, we formally define a formal notion of concept similarity under such subjective factors called concept similarity measure under preference profile and identify a set of its desirable properties. These properties relate to the question "what could be good preference-based similarity measures?". To exemplify the developments, we suggest computational techniques for FL0 and ELH, and also, prove their inherited properties. Two algorithmic procedures for our developed measure simπ are introduced for the top-down and bottom-up implementations, respectively, and their computational complexities are intensively studied. We also discuss the usefulness of our proposed developments to potential use cases.

Analogical reasoning is a complex process based on a comparison between two pairs of concepts or states of affairs (a.k.a. the source and the target) for characterizing certain features from the source to the target. To exploit our results of concept similarity measure, we investigate such kind of reasoning that analogical conclusions can be derived from the similarity between DL concepts. Two approaches for the implementation of analogical reasoning are explored. Each is formulated from the study of philosophical understanding called argumentation schemes where patterns of non-deductive reasoning are analyzed. Finally, we demonstrate that the analogical argument used in the case of Silkwood v. Kerr-McGee Corporation is re-constructible from the proposed formalisms.

It is a great honor for me to receive the awards from Her Royal Highness Princess Maha Chakri Sirindhorn of Thailand and the National Research Council. The bestowed award certificates and award plate give me a great motivation to do better research that can benefit the public in future.

award20230302-1.jpg award20230302-2.jpg
Award certificate bestowed by
Her Royal Highness Princess
Maha Chakri Sirindhorn of Thailand
Award certificate bestowed by the
National Research Council of Thailand

Award plate bestowed by the
National Research Council of Thailand

March 3, 2023