LiEP CIS-2000-035: A Logical Foundation of Metaphoric Search Based on Abstraction Approach.

Temporary registration page before publication by Linköping University Electronic Press, series Computer and Information Science

The following article is intended to be published shortly by Linköping University Electronic Press. The present page gives access to the article, but does not provide the guarantees of persistence.

A Logical Foundation of Metaphoric Search Based on Abstraction Approach.

Title:	A Logical Foundation of Metaphoric Search Based on Abstraction Approach.
Authors:	Makoto Haraguchi, Yoshiaki Okubo, and Tokuyasu Kakuta
Series:	Linköping Electronic Articles in Computer and Information Science ISSN 1401-9841
Issue:	Vol. 5(2000): nr 035
URL:	http://www.ep.liu.se/ea/cis/2000/035/

Abstract:	This paper presents a logical foundation of metaphoric search problem of looking for objects that can explain a given goal just like its typical instance, based on a concept graph representation. To determine what is similar to the instance under the presence of goal, we first form an abstract concept graph obtained by abstracting an explanation of the goal from the instance. Then, an object similar to the typical instance is required not only to satisfy the goal but also to be another instance of the abstract concept graph. Furthermore, we observe that generalization is also needed to obtain a non-trivial or useful abstraction and similarity based on it. So, we present an experimental system performing both abstraction and generalization to find a meaningful similarity from the viewpoint of goal.
Keywords:

Abstract:

This paper presents a logical foundation of metaphoric search problem of looking for objects that can explain a given goal just like its typical instance, based on a concept graph representation. To determine what is similar to the instance under the presence of goal, we first form an abstract concept graph obtained by abstracting an explanation of the goal from the instance. Then, an object similar to the typical instance is required not only to satisfy the goal but also to be another instance of the abstract concept graph. Furthermore, we observe that generalization is also needed to obtain a non-trivial or useful abstraction and similarity based on it. So, we present an experimental system performing both abstraction and generalization to find a meaningful similarity from the viewpoint of goal.

Keywords:

Intended publication 2000-12-21	Postscript part I -- Checksum Postscript part II -- Checksum II
Info from authors
Third-party information

[About LiEP] [About Checksum validation] [About compression formats]

Editor-in-chief: editor@ep.liu.se
Webmaster: webmaster@ep.liu.se