MINLP Based Retrieval of Generalized Cases

The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design automation. This paper addresses the similarity assessment and retrieval problem for case bases consisting of traditional and generalized cases. While approaches presented earlier were restricted to continuous domains, this paper addresses generalized cases defined over mixed, continuous and discrete, domains. It extends the view on the similarity assessment as a nonlinear optimization problem (NLP) towards a mixed integer nonlinear optimization problem (MINLP), which is an actual research topic in mathematical optimization. This is an important step because most real world applications require mixed domains for the case description. Furthermore, we introduce two optimization-based retrieval methods that operate on a previously created index structure, which restricts the retrieval response time significantly.

• Type: Conference
• Year: 2004
• Where: EWCBR
• Authors: Alexander Tartakovski, Martin Schaaf, Rainer Maximini, Ralph Bergmann
• Keywords: Automated Reasoning, EWCBR 2004, Generalized Cases, Nonlinear Optimization Problem, Similarity Assessment